./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i -s /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a39eefaccc62f602b71ff7e91e6bcef4799631 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:36:13,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:36:13,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:36:13,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:36:13,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:36:13,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:36:13,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:36:13,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:36:13,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:36:13,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:36:13,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:36:13,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:36:13,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:36:13,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:36:13,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:36:13,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:36:13,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:36:13,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:36:13,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:36:13,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:36:13,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:36:13,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:36:13,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:36:13,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:36:13,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:36:13,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:36:13,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:36:13,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:36:13,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:36:13,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:36:13,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:36:13,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:36:13,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:36:13,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:36:13,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:36:13,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:36:13,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:36:13,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:36:13,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:36:13,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:36:13,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:36:13,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:36:13,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:36:13,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:36:13,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:36:13,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:36:13,649 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:36:13,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:36:13,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:36:13,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:36:13,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:36:13,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:36:13,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:36:13,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:36:13,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:36:13,652 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:36:13,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2019-12-07 13:36:13,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:36:13,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:36:13,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:36:13,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:36:13,765 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:36:13,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-12-07 13:36:13,801 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/data/0fb56f02c/6782cc31977846769e2f2bc5a144caac/FLAG2f22c65be [2019-12-07 13:36:14,098 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:36:14,098 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-12-07 13:36:14,102 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/data/0fb56f02c/6782cc31977846769e2f2bc5a144caac/FLAG2f22c65be [2019-12-07 13:36:14,111 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/data/0fb56f02c/6782cc31977846769e2f2bc5a144caac [2019-12-07 13:36:14,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:36:14,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:36:14,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:36:14,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:36:14,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:36:14,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ccdd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14, skipping insertion in model container [2019-12-07 13:36:14,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:36:14,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:36:14,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:36:14,280 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:36:14,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:36:14,308 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:36:14,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14 WrapperNode [2019-12-07 13:36:14,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:36:14,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:36:14,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:36:14,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:36:14,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:36:14,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:36:14,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:36:14,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:36:14,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... [2019-12-07 13:36:14,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:36:14,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:36:14,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:36:14,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:36:14,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:36:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:36:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:36:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:36:14,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:36:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:36:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:36:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:36:14,522 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:36:14,522 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-12-07 13:36:14,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:36:14 BoogieIcfgContainer [2019-12-07 13:36:14,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:36:14,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:36:14,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:36:14,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:36:14,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:36:14" (1/3) ... [2019-12-07 13:36:14,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31204ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:36:14, skipping insertion in model container [2019-12-07 13:36:14,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:36:14" (2/3) ... [2019-12-07 13:36:14,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31204ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:36:14, skipping insertion in model container [2019-12-07 13:36:14,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:36:14" (3/3) ... [2019-12-07 13:36:14,528 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-12-07 13:36:14,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:36:14,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:36:14,545 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:36:14,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:36:14,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:36:14,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:36:14,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:36:14,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:36:14,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:36:14,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:36:14,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:36:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-12-07 13:36:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:36:14,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:14,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:14,574 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-12-07 13:36:14,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:14,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991557648] [2019-12-07 13:36:14,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:14,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991557648] [2019-12-07 13:36:14,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:14,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:14,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980827085] [2019-12-07 13:36:14,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 13:36:14,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:14,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 13:36:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 13:36:14,681 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-12-07 13:36:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:14,692 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-12-07 13:36:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:36:14,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 13:36:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:14,699 INFO L225 Difference]: With dead ends: 36 [2019-12-07 13:36:14,699 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 13:36:14,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 13:36:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 13:36:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 13:36:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 13:36:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-12-07 13:36:14,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-12-07 13:36:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:14,721 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 13:36:14,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 13:36:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-12-07 13:36:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:36:14,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:14,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:14,722 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-12-07 13:36:14,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:14,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380710064] [2019-12-07 13:36:14,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:14,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380710064] [2019-12-07 13:36:14,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:14,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:14,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568571362] [2019-12-07 13:36:14,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:14,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:14,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:14,754 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2019-12-07 13:36:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:14,778 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-12-07 13:36:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:14,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 13:36:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:14,779 INFO L225 Difference]: With dead ends: 34 [2019-12-07 13:36:14,779 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 13:36:14,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 13:36:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-12-07 13:36:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 13:36:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 13:36:14,783 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-12-07 13:36:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:14,783 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 13:36:14,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 13:36:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:36:14,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:14,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:14,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2019-12-07 13:36:14,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:14,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352826490] [2019-12-07 13:36:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:14,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352826490] [2019-12-07 13:36:14,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:14,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:14,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279651456] [2019-12-07 13:36:14,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:14,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:14,818 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-12-07 13:36:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:14,830 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-12-07 13:36:14,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:14,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 13:36:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:14,831 INFO L225 Difference]: With dead ends: 31 [2019-12-07 13:36:14,831 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 13:36:14,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 13:36:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 13:36:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 13:36:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-12-07 13:36:14,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-12-07 13:36:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:14,834 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-12-07 13:36:14,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-12-07 13:36:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:36:14,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:14,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:14,835 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2019-12-07 13:36:14,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:14,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655507746] [2019-12-07 13:36:14,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:36:14,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655507746] [2019-12-07 13:36:14,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:14,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:14,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130567861] [2019-12-07 13:36:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:14,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:14,863 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-12-07 13:36:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:14,872 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-12-07 13:36:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:14,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 13:36:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:14,873 INFO L225 Difference]: With dead ends: 32 [2019-12-07 13:36:14,873 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 13:36:14,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 13:36:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-12-07 13:36:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 13:36:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-12-07 13:36:14,875 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-12-07 13:36:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:14,876 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-12-07 13:36:14,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-12-07 13:36:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:36:14,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:14,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:14,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2019-12-07 13:36:14,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:14,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387310515] [2019-12-07 13:36:14,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:36:14,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387310515] [2019-12-07 13:36:14,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624026085] [2019-12-07 13:36:14,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/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 [2019-12-07 13:36:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:14,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:36:14,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:36:14,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:14,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-07 13:36:14,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9431253] [2019-12-07 13:36:14,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:14,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:14,991 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-12-07 13:36:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:15,007 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-12-07 13:36:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:36:15,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 13:36:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:15,008 INFO L225 Difference]: With dead ends: 34 [2019-12-07 13:36:15,008 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 13:36:15,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 13:36:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-12-07 13:36:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 13:36:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 13:36:15,011 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-12-07 13:36:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:15,011 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 13:36:15,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 13:36:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:36:15,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:15,012 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:15,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:15,212 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1949671069, now seen corresponding path program 2 times [2019-12-07 13:36:15,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:15,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416850832] [2019-12-07 13:36:15,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:36:15,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416850832] [2019-12-07 13:36:15,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801430704] [2019-12-07 13:36:15,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/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 [2019-12-07 13:36:15,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:36:15,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:15,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:36:15,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:36:15,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:15,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-12-07 13:36:15,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935847785] [2019-12-07 13:36:15,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:36:15,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:36:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:36:15,441 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-12-07 13:36:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:15,464 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-12-07 13:36:15,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:15,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 13:36:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:15,465 INFO L225 Difference]: With dead ends: 36 [2019-12-07 13:36:15,465 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 13:36:15,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:36:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 13:36:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-12-07 13:36:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:36:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-12-07 13:36:15,468 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-12-07 13:36:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:15,468 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 13:36:15,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:36:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-12-07 13:36:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:36:15,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:15,469 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:15,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:15,670 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash 381595099, now seen corresponding path program 3 times [2019-12-07 13:36:15,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:15,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973200813] [2019-12-07 13:36:15,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:36:15,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973200813] [2019-12-07 13:36:15,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258568857] [2019-12-07 13:36:15,777 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/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 [2019-12-07 13:36:15,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 13:36:15,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:15,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:36:15,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 13:36:15,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:15,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 13:36:15,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115986176] [2019-12-07 13:36:15,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:36:15,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:36:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:36:15,864 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-12-07 13:36:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:15,936 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-12-07 13:36:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:36:15,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 13:36:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:15,937 INFO L225 Difference]: With dead ends: 57 [2019-12-07 13:36:15,937 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 13:36:15,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:36:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 13:36:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-12-07 13:36:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 13:36:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-12-07 13:36:15,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-12-07 13:36:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:15,941 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-12-07 13:36:15,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:36:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-12-07 13:36:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:36:15,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:15,941 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:16,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:16,142 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 4 times [2019-12-07 13:36:16,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:16,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238908837] [2019-12-07 13:36:16,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:36:16,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238908837] [2019-12-07 13:36:16,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716298721] [2019-12-07 13:36:16,219 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:16,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:36:16,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:16,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:36:16,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 13:36:16,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:16,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-12-07 13:36:16,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724566976] [2019-12-07 13:36:16,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:36:16,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:16,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:36:16,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:36:16,291 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-12-07 13:36:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:16,362 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-12-07 13:36:16,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:36:16,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-07 13:36:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:16,364 INFO L225 Difference]: With dead ends: 72 [2019-12-07 13:36:16,364 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 13:36:16,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:36:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 13:36:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-12-07 13:36:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 13:36:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-12-07 13:36:16,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2019-12-07 13:36:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:16,368 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-12-07 13:36:16,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:36:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-12-07 13:36:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:36:16,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:16,370 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:16,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:16,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -441689129, now seen corresponding path program 5 times [2019-12-07 13:36:16,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291217242] [2019-12-07 13:36:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 13:36:16,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291217242] [2019-12-07 13:36:16,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042514910] [2019-12-07 13:36:16,664 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:16,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 13:36:16,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:16,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:36:16,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 13:36:16,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:16,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-12-07 13:36:16,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076655196] [2019-12-07 13:36:16,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:36:16,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:36:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:36:16,746 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-12-07 13:36:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:16,822 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-12-07 13:36:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:36:16,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-12-07 13:36:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:16,823 INFO L225 Difference]: With dead ends: 87 [2019-12-07 13:36:16,823 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 13:36:16,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:36:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 13:36:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-12-07 13:36:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 13:36:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-12-07 13:36:16,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2019-12-07 13:36:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:16,827 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-12-07 13:36:16,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:36:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-12-07 13:36:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:36:16,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:16,828 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:17,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:17,029 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1895354217, now seen corresponding path program 6 times [2019-12-07 13:36:17,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:17,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994717598] [2019-12-07 13:36:17,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 13:36:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994717598] [2019-12-07 13:36:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955685570] [2019-12-07 13:36:17,123 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:17,168 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 13:36:17,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:17,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 13:36:17,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:17,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:36:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 13:36:17,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:17,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 13:36:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489982584] [2019-12-07 13:36:17,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:36:17,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:36:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:36:17,239 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-12-07 13:36:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:17,416 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-12-07 13:36:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 13:36:17,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-12-07 13:36:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:17,417 INFO L225 Difference]: With dead ends: 71 [2019-12-07 13:36:17,417 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 13:36:17,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:36:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 13:36:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-12-07 13:36:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 13:36:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 13:36:17,422 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-12-07 13:36:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:17,423 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 13:36:17,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:36:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 13:36:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:36:17,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:17,424 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:17,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:17,625 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -958805492, now seen corresponding path program 1 times [2019-12-07 13:36:17,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:17,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385744283] [2019-12-07 13:36:17,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 13:36:17,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385744283] [2019-12-07 13:36:17,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:17,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:17,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218381493] [2019-12-07 13:36:17,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:17,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:17,682 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-12-07 13:36:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:17,685 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-12-07 13:36:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:17,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 13:36:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:17,686 INFO L225 Difference]: With dead ends: 49 [2019-12-07 13:36:17,686 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 13:36:17,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 13:36:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 13:36:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 13:36:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-12-07 13:36:17,690 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-12-07 13:36:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:17,690 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-12-07 13:36:17,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-12-07 13:36:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:36:17,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:17,691 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:17,691 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1921874774, now seen corresponding path program 1 times [2019-12-07 13:36:17,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:17,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923444326] [2019-12-07 13:36:17,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 13:36:17,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923444326] [2019-12-07 13:36:17,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280065776] [2019-12-07 13:36:17,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:17,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:36:17,797 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 13:36:17,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:17,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-12-07 13:36:17,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418659255] [2019-12-07 13:36:17,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 13:36:17,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 13:36:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:36:17,890 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2019-12-07 13:36:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:17,918 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-12-07 13:36:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:36:17,919 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-12-07 13:36:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:17,920 INFO L225 Difference]: With dead ends: 70 [2019-12-07 13:36:17,920 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 13:36:17,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:36:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 13:36:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-12-07 13:36:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 13:36:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-12-07 13:36:17,925 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-12-07 13:36:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:17,925 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-12-07 13:36:17,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 13:36:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-12-07 13:36:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:36:17,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:17,926 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:18,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:18,127 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash 575418516, now seen corresponding path program 2 times [2019-12-07 13:36:18,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:18,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691330622] [2019-12-07 13:36:18,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 13:36:18,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691330622] [2019-12-07 13:36:18,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561843443] [2019-12-07 13:36:18,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:18,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:36:18,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:18,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:36:18,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 13:36:18,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:18,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-12-07 13:36:18,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499663760] [2019-12-07 13:36:18,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 13:36:18,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:18,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 13:36:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:36:18,410 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-12-07 13:36:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:18,440 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 13:36:18,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:36:18,441 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-12-07 13:36:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:18,441 INFO L225 Difference]: With dead ends: 72 [2019-12-07 13:36:18,442 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 13:36:18,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:36:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 13:36:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-12-07 13:36:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 13:36:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-12-07 13:36:18,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-12-07 13:36:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:18,446 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-12-07 13:36:18,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 13:36:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-12-07 13:36:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:36:18,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:18,447 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:18,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:18,648 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash -583889326, now seen corresponding path program 3 times [2019-12-07 13:36:18,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:18,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138208785] [2019-12-07 13:36:18,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 13:36:18,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138208785] [2019-12-07 13:36:18,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233516622] [2019-12-07 13:36:18,756 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:18,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 13:36:18,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:36:18,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 13:36:18,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:36:18,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 13:36:18,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:36:18,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:36:18,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:36:18,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 13:36:18,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:36:18,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-12-07 13:36:18,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:36:18,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:36:18,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:36:18,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:36:18,919 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:36:18,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-12-07 13:36:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 13:36:18,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:36:18,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-12-07 13:36:18,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254808253] [2019-12-07 13:36:18,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 13:36:18,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 13:36:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:36:18,971 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2019-12-07 13:36:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:21,816 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-12-07 13:36:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 13:36:21,817 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-12-07 13:36:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:21,817 INFO L225 Difference]: With dead ends: 63 [2019-12-07 13:36:21,817 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:36:21,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 13:36:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:36:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:36:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:36:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:36:21,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-12-07 13:36:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:21,819 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:36:21,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 13:36:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:36:21,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:36:22,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:36:22,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:36:22,157 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-12-07 13:36:22,183 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-12-07 13:36:22,183 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (= ULTIMATE.start_main_~flag~0 1) [2019-12-07 13:36:22,183 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-12-07 13:36:22,183 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-12-07 13:36:22,183 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 13:36:22,183 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:36:22,183 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 100000) (<= 99999 v_ULTIMATE.start_init_~i~0_26)))) (.cse3 (= ULTIMATE.start_init_~size 100000)) (.cse4 (= ULTIMATE.start_main_~flag~0 0)) (.cse5 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse6 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)))))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 (<= ULTIMATE.start_main_~i~1 99999) .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse5 .cse6) (= ULTIMATE.start_main_~flag~0 1) (and .cse0 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (= ULTIMATE.start_init_~size 100000)) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_init_~i~0 0)))) [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-12-07 13:36:22,184 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-12-07 13:36:22,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 13:36:22,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 13:36:22,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:36:22 BoogieIcfgContainer [2019-12-07 13:36:22,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:36:22,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:36:22,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:36:22,208 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:36:22,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:36:14" (3/4) ... [2019-12-07 13:36:22,211 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:36:22,217 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 13:36:22,217 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 13:36:22,218 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 13:36:22,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && i == 0) [2019-12-07 13:36:22,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == #memory_$Pointer$[a][a] && a == 0) && i <= 99999) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || flag == 1) || (((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) [2019-12-07 13:36:22,246 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_17e2006f-a3e3-490b-93e3-884493b52104/bin/uautomizer/witness.graphml [2019-12-07 13:36:22,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:36:22,247 INFO L168 Benchmark]: Toolchain (without parser) took 8133.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.4 MB in the beginning and 905.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 176.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:22,247 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:36:22,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:22,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:36:22,248 INFO L168 Benchmark]: Boogie Preprocessor took 16.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:22,248 INFO L168 Benchmark]: RCFGBuilder took 172.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:22,248 INFO L168 Benchmark]: TraceAbstraction took 7684.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 155.5 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:22,248 INFO L168 Benchmark]: Witness Printer took 37.84 ms. Allocated memory is still 1.2 GB. Free memory was 913.7 MB in the beginning and 905.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:36:22,250 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7684.02 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 155.5 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. * Witness Printer took 37.84 ms. Allocated memory is still 1.2 GB. Free memory was 913.7 MB in the beginning and 905.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 13:36:22,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 13:36:22,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,256 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((0 == #memory_$Pointer$[a][a] && a == 0) && i <= 99999) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || flag == 1) || (((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < 100000) && 99999 <= v_ULTIMATE.start_init_~i~0_26)) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-12-07 13:36:22,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 13:36:22,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 13:36:22,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,262 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-12-07 13:36:22,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) || (((((a == 0 && a == a) && size == 100000) && flag == 0) && a == a) && i == 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 214 SDtfs, 241 SDslu, 499 SDs, 0 SdLazy, 507 SolverSat, 69 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=13, 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, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 630 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 619 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 596 ConstructedInterpolants, 12 QuantifiedInterpolants, 79467 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 424/879 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...