/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:17:21,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:17:21,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:17:21,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:17:21,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:17:21,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:17:21,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:17:21,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:17:21,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:17:21,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:17:21,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:17:21,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:17:21,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:17:21,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:17:21,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:17:21,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:17:21,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:17:21,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:17:21,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:17:21,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:17:21,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:17:21,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:17:21,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:17:21,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:17:21,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:17:21,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:17:21,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:17:21,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:17:21,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:17:21,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:17:21,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:17:21,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:17:21,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:17:21,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:17:21,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:17:21,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:17:21,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:17:21,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:17:21,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:17:21,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:17:21,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:17:21,782 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:17:21,796 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:17:21,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:17:21,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:17:21,798 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:17:21,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:17:21,798 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:17:21,798 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:17:21,798 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:17:21,798 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:17:21,799 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:17:21,799 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:17:21,799 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:17:21,799 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:17:21,799 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:17:21,800 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:17:21,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:17:21,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:17:21,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:17:21,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:17:21,800 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:17:21,801 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:17:21,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:17:21,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:17:21,801 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:17:21,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:17:21,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:17:21,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:17:21,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:17:21,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:17:21,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:17:21,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:17:21,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:17:21,984 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:17:21,984 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:17:21,985 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:17:22,054 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_dxpaaI/tmp/254eb8c5a41848398e55613a7314713d/FLAGe104745d3 [2020-07-01 13:17:22,405 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:17:22,406 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:17:22,406 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:17:22,413 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_dxpaaI/tmp/254eb8c5a41848398e55613a7314713d/FLAGe104745d3 [2020-07-01 13:17:22,797 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_dxpaaI/tmp/254eb8c5a41848398e55613a7314713d [2020-07-01 13:17:22,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:17:22,810 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:17:22,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:17:22,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:17:22,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:17:22,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:17:22" (1/1) ... [2020-07-01 13:17:22,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adc1c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:22, skipping insertion in model container [2020-07-01 13:17:22,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:17:22" (1/1) ... [2020-07-01 13:17:22,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:17:22,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:17:23,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:17:23,081 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:17:23,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:17:23,114 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:17:23,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23 WrapperNode [2020-07-01 13:17:23,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:17:23,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:17:23,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:17:23,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:17:23,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:17:23,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:17:23,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:17:23,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:17:23,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:17:23,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:17:23,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:17:23,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:17:23,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:17:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:17:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:17:23,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:17:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:17:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:17:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:17:23,518 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:17:23,518 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-01 13:17:23,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23 BoogieIcfgContainer [2020-07-01 13:17:23,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:17:23,523 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:17:23,523 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:17:23,525 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:17:23,526 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23" (1/1) ... [2020-07-01 13:17:23,546 INFO L313 BlockEncoder]: Initial Icfg 34 locations, 40 edges [2020-07-01 13:17:23,547 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:17:23,548 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:17:23,549 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:17:23,549 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:17:23,551 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:17:23,552 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:17:23,552 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:17:23,576 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:17:23,601 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 13:17:23,606 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-07-01 13:17:23,623 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:17:23,657 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 13:17:23,660 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:17:23,661 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:17:23,662 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:17:23,662 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:17:23,663 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:17:23,663 INFO L313 BlockEncoder]: Encoded RCFG 24 locations, 40 edges [2020-07-01 13:17:23,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:17:23 BasicIcfg [2020-07-01 13:17:23,664 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:17:23,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:17:23,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:17:23,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:17:23,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:17:22" (1/4) ... [2020-07-01 13:17:23,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63166fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (2/4) ... [2020-07-01 13:17:23,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63166fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23" (3/4) ... [2020-07-01 13:17:23,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63166fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:17:23, skipping insertion in model container [2020-07-01 13:17:23,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:17:23" (4/4) ... [2020-07-01 13:17:23,672 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:17:23,683 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:17:23,691 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-07-01 13:17:23,705 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-07-01 13:17:23,729 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:17:23,729 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:17:23,729 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:17:23,729 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:17:23,729 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:17:23,729 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:17:23,729 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:17:23,730 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:17:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-01 13:17:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:17:23,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:17:23,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:17:23,752 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:17:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash 174224749, now seen corresponding path program 1 times [2020-07-01 13:17:23,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:23,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065267480] [2020-07-01 13:17:23,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:23,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065267480] [2020-07-01 13:17:23,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:17:23,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:17:23,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486645938] [2020-07-01 13:17:23,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:17:23,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:17:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:17:23,962 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-07-01 13:17:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:24,066 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2020-07-01 13:17:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:17:24,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:17:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:17:24,079 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:17:24,080 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:17:24,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:17:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:17:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 13:17:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 13:17:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-07-01 13:17:24,119 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 5 [2020-07-01 13:17:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:17:24,119 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-07-01 13:17:24,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:17:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-07-01 13:17:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:17:24,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:17:24,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:17:24,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:17:24,122 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:17:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:24,123 INFO L82 PathProgramCache]: Analyzing trace with hash 174224751, now seen corresponding path program 1 times [2020-07-01 13:17:24,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:24,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279321533] [2020-07-01 13:17:24,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:24,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279321533] [2020-07-01 13:17:24,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:17:24,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:17:24,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736596411] [2020-07-01 13:17:24,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:17:24,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:17:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:17:24,160 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2020-07-01 13:17:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:24,282 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-07-01 13:17:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:17:24,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:17:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:17:24,284 INFO L225 Difference]: With dead ends: 39 [2020-07-01 13:17:24,284 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:17:24,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:17:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:17:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-07-01 13:17:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:17:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-07-01 13:17:24,291 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 5 [2020-07-01 13:17:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:17:24,292 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-07-01 13:17:24,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:17:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-07-01 13:17:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:17:24,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:17:24,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:17:24,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:17:24,293 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:17:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash 174224752, now seen corresponding path program 1 times [2020-07-01 13:17:24,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:24,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632745442] [2020-07-01 13:17:24,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:24,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632745442] [2020-07-01 13:17:24,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:17:24,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:17:24,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138211791] [2020-07-01 13:17:24,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:17:24,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:24,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:17:24,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:17:24,341 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. [2020-07-01 13:17:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:24,446 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-07-01 13:17:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:17:24,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:17:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:17:24,448 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:17:24,448 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:17:24,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:17:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:17:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:17:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:17:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2020-07-01 13:17:24,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 5 [2020-07-01 13:17:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:17:24,454 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-07-01 13:17:24,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:17:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2020-07-01 13:17:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:17:24,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:17:24,455 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:17:24,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:17:24,455 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:17:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:24,456 INFO L82 PathProgramCache]: Analyzing trace with hash 807367606, now seen corresponding path program 1 times [2020-07-01 13:17:24,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:24,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804576823] [2020-07-01 13:17:24,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:24,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804576823] [2020-07-01 13:17:24,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392336123] [2020-07-01 13:17:24,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:24,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:17:24,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:24,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:17:24,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2020-07-01 13:17:24,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433047931] [2020-07-01 13:17:24,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:17:24,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:17:24,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:17:24,616 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2020-07-01 13:17:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:24,751 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2020-07-01 13:17:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:17:24,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 13:17:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:17:24,753 INFO L225 Difference]: With dead ends: 53 [2020-07-01 13:17:24,753 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:17:24,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:17:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:17:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:17:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:17:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2020-07-01 13:17:24,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 10 [2020-07-01 13:17:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:17:24,759 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2020-07-01 13:17:24,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:17:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-01 13:17:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:17:24,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:17:24,760 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:17:24,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:24,961 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:17:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1487425976, now seen corresponding path program 1 times [2020-07-01 13:17:24,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:24,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202018455] [2020-07-01 13:17:24,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:25,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202018455] [2020-07-01 13:17:25,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197763688] [2020-07-01 13:17:25,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:25,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:17:25,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:25,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:17:25,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-07-01 13:17:25,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144843618] [2020-07-01 13:17:25,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:17:25,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:17:25,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:17:25,085 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 4 states. [2020-07-01 13:17:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:25,152 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-01 13:17:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:17:25,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 13:17:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:17:25,153 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:17:25,153 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:17:25,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:17:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:17:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:17:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:17:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-07-01 13:17:25,158 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2020-07-01 13:17:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:17:25,159 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-01 13:17:25,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:17:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-01 13:17:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:17:25,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:17:25,160 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:17:25,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:25,361 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:17:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1487425977, now seen corresponding path program 1 times [2020-07-01 13:17:25,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:25,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173114039] [2020-07-01 13:17:25,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:17:25,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173114039] [2020-07-01 13:17:25,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740066976] [2020-07-01 13:17:25,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:25,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 13:17:25,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:17:25,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 13:17:25,501 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:17:25,515 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:17:25,520 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:17:25,521 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:22 [2020-07-01 13:17:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:17:25,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:17:25,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 13:17:25,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800030036] [2020-07-01 13:17:25,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:17:25,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:17:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:17:25,562 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2020-07-01 13:17:30,949 WARN L192 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-07-01 13:17:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:31,008 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-01 13:17:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:17:31,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 13:17:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:17:31,009 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:17:31,009 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:17:31,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:17:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:17:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:17:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:17:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:17:31,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-07-01 13:17:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:17:31,011 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:17:31,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:17:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:17:31,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:17:31,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:17:31,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:17:31,444 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-07-01 13:17:31,640 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-07-01 13:17:31,643 INFO L268 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-07-01 13:17:31,643 INFO L268 CegarLoopResult]: For program point L15-2(lines 10 19) no Hoare annotation was computed. [2020-07-01 13:17:31,643 INFO L268 CegarLoopResult]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2020-07-01 13:17:31,644 INFO L264 CegarLoopResult]: At program point L11-3(lines 11 14) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) (.cse1 (select |#length| ULTIMATE.start_test_fun_~a.base)) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse3 (= 0 ULTIMATE.start_test_fun_~a.offset))) (or (and .cse0 (<= (* 4 ULTIMATE.start_test_fun_~N) .cse1) .cse2 (= 0 (mod (* .cse1 3) (- 4))) .cse3 (<= 0 ULTIMATE.start_test_fun_~i~0) (<= (+ ULTIMATE.start_test_fun_~i~0 1) (div (* .cse1 (- 1)) (- 4)))) (and .cse0 (<= 4 .cse1) .cse2 (<= ULTIMATE.start_main_~array_size~0 1) (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0) .cse3))) [2020-07-01 13:17:31,644 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:17:31,644 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-01 13:17:31,644 INFO L268 CegarLoopResult]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2020-07-01 13:17:31,644 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:17:31,644 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:17:31,645 INFO L268 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-07-01 13:17:31,646 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:17:31,646 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:17:31,646 INFO L264 CegarLoopResult]: At program point L10-3(lines 10 19) the Hoare annotation is: (let ((.cse10 (select |#length| ULTIMATE.start_test_fun_~a.base))) (let ((.cse3 (= 0 (mod (* .cse10 3) (- 4)))) (.cse5 (<= ULTIMATE.start_test_fun_~N (div (* .cse10 (- 1)) (- 4)))) (.cse7 (<= 1 ULTIMATE.start_test_fun_~i~0)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) (.cse1 (<= 4 .cse10)) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse8 (<= ULTIMATE.start_main_~array_size~0 1)) (.cse9 (<= ULTIMATE.start_test_fun_~N 1)) (.cse4 (= 0 ULTIMATE.start_test_fun_~a.offset)) (.cse6 (<= 0 ULTIMATE.start_test_fun_~i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse2 .cse8 .cse9 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse6)))) [2020-07-01 13:17:31,646 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:17:31,646 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:17:31,646 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:17:31,649 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:17:31,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,672 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,672 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,672 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:17:31 BasicIcfg [2020-07-01 13:17:31,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:17:31,675 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:17:31,675 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:17:31,678 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:17:31,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:31,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:17:22" (1/5) ... [2020-07-01 13:17:31,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eee0144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:17:31, skipping insertion in model container [2020-07-01 13:17:31,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:31,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:17:23" (2/5) ... [2020-07-01 13:17:31,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eee0144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:17:31, skipping insertion in model container [2020-07-01 13:17:31,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:31,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:17:23" (3/5) ... [2020-07-01 13:17:31,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eee0144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:17:31, skipping insertion in model container [2020-07-01 13:17:31,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:31,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:17:23" (4/5) ... [2020-07-01 13:17:31,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3eee0144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:17:31, skipping insertion in model container [2020-07-01 13:17:31,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:17:31,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:17:31" (5/5) ... [2020-07-01 13:17:31,684 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:17:31,704 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:17:31,705 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:17:31,705 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:17:31,705 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:17:31,705 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:17:31,705 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:17:31,705 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:17:31,705 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:17:31,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-01 13:17:31,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:17:31,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:31,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:31,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:17:31,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 13:17:31,719 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:17:31,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-01 13:17:31,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:17:31,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:17:31,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:17:31,721 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:17:31,721 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 13:17:31,726 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue [154] ULTIMATE.startENTRY-->L24: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.offset] 24#L24true [111] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 19#L24-2true [129] L24-2-->L10-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~pos~0_1 0) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1) |v_#valid_5|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_test_fun_~neg~0_1 0) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc10.base_4| (* v_ULTIMATE.start_main_~array_size~0_7 4)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#t~post7=|v_ULTIMATE.start_test_fun_#t~post7_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~post8=|v_ULTIMATE.start_test_fun_#t~post8_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_test_fun_~neg~0=v_ULTIMATE.start_test_fun_~neg~0_1, #valid=|v_#valid_5|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1, ULTIMATE.start_test_fun_~pos~0=v_ULTIMATE.start_test_fun_~pos~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#t~post7, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post8, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_test_fun_~neg~0, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0, ULTIMATE.start_test_fun_~pos~0, ULTIMATE.start_main_#t~malloc10.offset] 9#L10-3true [2020-07-01 13:17:31,726 INFO L796 eck$LassoCheckResult]: Loop: 9#L10-3true [97] L10-3-->L11-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 11#L11-3true [77] L11-3-->L11-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse0 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) (+ v_ULTIMATE.start_test_fun_~a.offset_3 (* v_ULTIMATE.start_test_fun_~i~0_6 4)))) (<= 0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 15#L11-1true [118] L11-1-->L15-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 22#L15-2true [106] L15-2-->L15: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (and (<= (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~a.base_12)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~a.base_12)) (<= 0 (+ .cse0 v_ULTIMATE.start_test_fun_~a.offset_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~a.base_12) (+ (* v_ULTIMATE.start_test_fun_~i~0_12 4) v_ULTIMATE.start_test_fun_~a.offset_9))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_9, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_12, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 3#L15true [159] L15-->L10-3: Formula: (and (= v_ULTIMATE.start_test_fun_~i~0_24 (+ v_ULTIMATE.start_test_fun_~i~0_25 1)) (<= |v_ULTIMATE.start_test_fun_#t~mem5_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_24} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 9#L10-3true [2020-07-01 13:17:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 181355, now seen corresponding path program 1 times [2020-07-01 13:17:31,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:31,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233433164] [2020-07-01 13:17:31,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:17:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:17:31,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233433164] [2020-07-01 13:17:31,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:17:31,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:17:31,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636810699] [2020-07-01 13:17:31,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:17:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:17:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash 120621438, now seen corresponding path program 1 times [2020-07-01 13:17:31,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:17:31,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109870198] [2020-07-01 13:17:31,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:17:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:17:31,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:17:31,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:17:31,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:17:31,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:17:31,818 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-07-01 13:17:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:17:31,855 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-07-01 13:17:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:17:31,858 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:17:31,862 INFO L168 Benchmark]: Toolchain (without parser) took 9051.98 ms. Allocated memory was 649.6 MB in the beginning and 748.7 MB in the end (delta: 99.1 MB). Free memory was 561.7 MB in the beginning and 664.8 MB in the end (delta: -103.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:17:31,862 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:17:31,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.84 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 561.7 MB in the beginning and 644.0 MB in the end (delta: -82.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.78 ms. Allocated memory is still 682.1 MB. Free memory was 644.0 MB in the beginning and 642.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,864 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 682.1 MB. Free memory was 642.6 MB in the beginning and 639.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,864 INFO L168 Benchmark]: RCFGBuilder took 342.00 ms. Allocated memory is still 682.1 MB. Free memory was 639.9 MB in the beginning and 617.5 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,865 INFO L168 Benchmark]: BlockEncodingV2 took 140.45 ms. Allocated memory is still 682.1 MB. Free memory was 617.5 MB in the beginning and 608.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,865 INFO L168 Benchmark]: TraceAbstraction took 8009.27 ms. Allocated memory was 682.1 MB in the beginning and 748.7 MB in the end (delta: 66.6 MB). Free memory was 606.7 MB in the beginning and 688.2 MB in the end (delta: -81.5 MB). Peak memory consumption was 233.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,866 INFO L168 Benchmark]: BuchiAutomizer took 185.45 ms. Allocated memory is still 748.7 MB. Free memory was 688.2 MB in the beginning and 664.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:17:31,869 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 34 locations, 40 edges - StatisticsResult: Encoded RCFG 24 locations, 40 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.84 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 561.7 MB in the beginning and 644.0 MB in the end (delta: -82.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.78 ms. Allocated memory is still 682.1 MB. Free memory was 644.0 MB in the beginning and 642.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 682.1 MB. Free memory was 642.6 MB in the beginning and 639.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 342.00 ms. Allocated memory is still 682.1 MB. Free memory was 639.9 MB in the beginning and 617.5 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.45 ms. Allocated memory is still 682.1 MB. Free memory was 617.5 MB in the beginning and 608.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 8009.27 ms. Allocated memory was 682.1 MB in the beginning and 748.7 MB in the end (delta: 66.6 MB). Free memory was 606.7 MB in the beginning and 688.2 MB in the end (delta: -81.5 MB). Peak memory consumption was 233.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 185.45 ms. Allocated memory is still 748.7 MB. Free memory was 688.2 MB in the beginning and 664.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 13:17:31,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 0 <= i) || (((((1 == \valid[a] && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 1 <= i)) || ((((1 == \valid[a] && 1 <= array_size) && array_size <= 1) && N <= 1) && 1 <= i)) || ((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && array_size <= 1) && N <= 1) && 0 == a) && 0 <= i) - InvariantResult [Line: 11]: Loop Invariant [2020-07-01 13:17:31,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:17:31,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((1 == \valid[a] && 4 * N <= unknown-#length-unknown[a]) && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && 0 <= i) && i + 1 <= unknown-#length-unknown[a] * -1 / -4) || ((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && array_size <= 1) && N <= 1) && 0 == i) && 0 == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.4s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 SDtfs, 156 SDslu, 59 SDs, 0 SdLazy, 252 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 9 NumberOfFragments, 185 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 4175 SizeOfPredicates, 16 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:17:19.499 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_dxpaaI/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:17:32.112 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check