./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/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 70ed6db55ef12ba895ae550f72b14964713abf72 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:05:23,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:05:23,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:05:23,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:05:23,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:05:23,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:05:23,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:05:23,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:05:23,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:05:23,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:05:23,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:05:23,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:05:23,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:05:23,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:05:23,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:05:23,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:05:23,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:05:23,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:05:23,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:05:23,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:05:23,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:05:23,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:05:23,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:05:23,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:05:23,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:05:23,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:05:23,619 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:05:23,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:05:23,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:05:23,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:05:23,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:05:23,622 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:05:23,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:05:23,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:05:23,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:05:23,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:05:23,625 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 06:05:23,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:05:23,634 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:05:23,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:05:23,635 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:05:23,636 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:05:23,636 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:05:23,636 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:05:23,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:05:23,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:05:23,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:05:23,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:05:23,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:05:23,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:05:23,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:05:23,638 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:05:23,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:05:23,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:05:23,639 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/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 -> 70ed6db55ef12ba895ae550f72b14964713abf72 [2018-11-10 06:05:23,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:05:23,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:05:23,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:05:23,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:05:23,676 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:05:23,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/../../sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c [2018-11-10 06:05:23,720 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/data/d8ea1f606/80c7639c34d24c18afe5238f16053da3/FLAGd22419344 [2018-11-10 06:05:24,111 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:05:24,112 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/sv-benchmarks/c/loops-crafted-1/nested3_true-unreach-call.c [2018-11-10 06:05:24,115 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/data/d8ea1f606/80c7639c34d24c18afe5238f16053da3/FLAGd22419344 [2018-11-10 06:05:24,124 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/data/d8ea1f606/80c7639c34d24c18afe5238f16053da3 [2018-11-10 06:05:24,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:05:24,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 06:05:24,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:05:24,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:05:24,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:05:24,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680a2912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24, skipping insertion in model container [2018-11-10 06:05:24,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:05:24,149 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:05:24,244 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:05:24,246 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:05:24,256 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:05:24,264 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:05:24,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24 WrapperNode [2018-11-10 06:05:24,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:05:24,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:05:24,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:05:24,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:05:24,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... [2018-11-10 06:05:24,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:05:24,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:05:24,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:05:24,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:05:24,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/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 [2018-11-10 06:05:24,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:05:24,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:05:24,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 06:05:24,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:05:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 06:05:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 06:05:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:05:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:05:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:05:24,488 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:05:24,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:24 BoogieIcfgContainer [2018-11-10 06:05:24,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:05:24,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:05:24,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:05:24,492 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:05:24,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:05:24" (1/3) ... [2018-11-10 06:05:24,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b52cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:24, skipping insertion in model container [2018-11-10 06:05:24,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:24" (2/3) ... [2018-11-10 06:05:24,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b52cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:24, skipping insertion in model container [2018-11-10 06:05:24,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:24" (3/3) ... [2018-11-10 06:05:24,495 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3_true-unreach-call.c [2018-11-10 06:05:24,503 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:05:24,510 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 06:05:24,520 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 06:05:24,544 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:05:24,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:05:24,545 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:05:24,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:05:24,545 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:05:24,545 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:05:24,545 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:05:24,545 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:05:24,546 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:05:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-10 06:05:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 06:05:24,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:24,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:24,568 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:24,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 17946046, now seen corresponding path program 1 times [2018-11-10 06:05:24,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:24,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:24,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:24,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:05:24,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:05:24,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:05:24,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:05:24,666 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-10 06:05:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:24,682 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2018-11-10 06:05:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:05:24,683 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 06:05:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:24,690 INFO L225 Difference]: With dead ends: 47 [2018-11-10 06:05:24,690 INFO L226 Difference]: Without dead ends: 22 [2018-11-10 06:05:24,692 INFO L605 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 [2018-11-10 06:05:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-10 06:05:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 06:05:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 06:05:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 06:05:24,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2018-11-10 06:05:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:24,718 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 06:05:24,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:05:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-10 06:05:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 06:05:24,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:24,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:24,719 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:24,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash -583657870, now seen corresponding path program 1 times [2018-11-10 06:05:24,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:24,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:05:24,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:05:24,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:05:24,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:24,767 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-10 06:05:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:24,780 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-10 06:05:24,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:05:24,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 06:05:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:24,781 INFO L225 Difference]: With dead ends: 39 [2018-11-10 06:05:24,781 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 06:05:24,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 06:05:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-10 06:05:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 06:05:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 06:05:24,787 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2018-11-10 06:05:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:24,788 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 06:05:24,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:05:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-10 06:05:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 06:05:24,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:24,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:24,789 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:24,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2034978746, now seen corresponding path program 1 times [2018-11-10 06:05:24,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:24,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:24,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:24,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:05:24,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:05:24,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:05:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:24,832 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-10 06:05:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:24,852 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-10 06:05:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:05:24,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 06:05:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:24,853 INFO L225 Difference]: With dead ends: 47 [2018-11-10 06:05:24,853 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 06:05:24,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 06:05:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-10 06:05:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 06:05:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-10 06:05:24,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-10 06:05:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:24,858 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-10 06:05:24,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:05:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-10 06:05:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 06:05:24,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:24,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:24,859 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:24,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2046656706, now seen corresponding path program 1 times [2018-11-10 06:05:24,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:24,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:24,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:24,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:05:24,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:05:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:05:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:24,902 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-10 06:05:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:24,920 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-10 06:05:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:05:24,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 06:05:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:24,921 INFO L225 Difference]: With dead ends: 49 [2018-11-10 06:05:24,921 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 06:05:24,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 06:05:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-10 06:05:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 06:05:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-10 06:05:24,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-10 06:05:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:24,929 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-10 06:05:24,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:05:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-10 06:05:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 06:05:24,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:24,930 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:24,930 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:24,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 441532680, now seen corresponding path program 1 times [2018-11-10 06:05:24,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:24,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:24,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:24,975 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:24,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:25,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:25,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:25,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 06:05:25,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:05:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:05:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:05:25,049 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2018-11-10 06:05:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:25,071 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-10 06:05:25,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:05:25,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 06:05:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:25,072 INFO L225 Difference]: With dead ends: 53 [2018-11-10 06:05:25,072 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 06:05:25,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:05:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 06:05:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 06:05:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 06:05:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-10 06:05:25,076 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-10 06:05:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:25,076 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-10 06:05:25,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:05:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-10 06:05:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 06:05:25,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:25,077 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:25,077 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:25,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -189397042, now seen corresponding path program 2 times [2018-11-10 06:05:25,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:25,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:25,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:25,139 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:05:25,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:05:25,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:05:25,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:25,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 06:05:25,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:05:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:05:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:05:25,201 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-10 06:05:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:25,230 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-10 06:05:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:05:25,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-10 06:05:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:25,231 INFO L225 Difference]: With dead ends: 57 [2018-11-10 06:05:25,231 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 06:05:25,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:05:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 06:05:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-10 06:05:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 06:05:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-10 06:05:25,236 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-10 06:05:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:25,236 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-10 06:05:25,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:05:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-10 06:05:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 06:05:25,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:25,237 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:25,237 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:25,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash -922471148, now seen corresponding path program 3 times [2018-11-10 06:05:25,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:25,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:25,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:05:25,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:25,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:25,317 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:25,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:05:25,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 06:05:25,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:05:25,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:28,355 WARN L179 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-10 06:05:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:05:32,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:05:32,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-10 06:05:32,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 06:05:32,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 06:05:32,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2018-11-10 06:05:32,837 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2018-11-10 06:05:34,871 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 4294967296)) (.cse1 (mod v_prenex_1 4))) (and (<= 268435455 .cse0) (<= 0 .cse0) (= |c___VERIFIER_assert_#in~cond| .cse1) (<= .cse1 2147483647) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 4294967296)) (.cse3 (mod v_prenex_1 4))) (and (<= 268435455 .cse2) (<= 0 .cse2) (= .cse3 c___VERIFIER_assert_~cond) (<= .cse3 2147483647) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455))))) is different from false [2018-11-10 06:05:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:38,912 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-10 06:05:38,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:05:38,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-10 06:05:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:38,913 INFO L225 Difference]: With dead ends: 63 [2018-11-10 06:05:38,913 INFO L226 Difference]: Without dead ends: 38 [2018-11-10 06:05:38,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=23, Invalid=69, Unknown=2, NotChecked=16, Total=110 [2018-11-10 06:05:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-10 06:05:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-10 06:05:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 06:05:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-10 06:05:38,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2018-11-10 06:05:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:38,918 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-10 06:05:38,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 06:05:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-10 06:05:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 06:05:38,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:38,919 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:38,920 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:38,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash 470622036, now seen corresponding path program 1 times [2018-11-10 06:05:38,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:38,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:05:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 06:05:38,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:38,981 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:38,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:38,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:05:39,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:39,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 6 [2018-11-10 06:05:39,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 06:05:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:05:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:05:39,073 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-10 06:05:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:39,104 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-11-10 06:05:39,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:05:39,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-10 06:05:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:39,105 INFO L225 Difference]: With dead ends: 93 [2018-11-10 06:05:39,105 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 06:05:39,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:05:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 06:05:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-11-10 06:05:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 06:05:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-10 06:05:39,110 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 31 [2018-11-10 06:05:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:39,110 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-10 06:05:39,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 06:05:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-10 06:05:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 06:05:39,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:39,111 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:39,111 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:39,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1847065710, now seen corresponding path program 2 times [2018-11-10 06:05:39,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:39,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:39,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 58 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 06:05:39,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:39,186 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:39,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:05:39,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:05:39,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:05:39,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 06:05:39,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:39,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 8 [2018-11-10 06:05:39,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 06:05:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:05:39,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:05:39,282 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 8 states. [2018-11-10 06:05:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:39,333 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-11-10 06:05:39,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:05:39,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 06:05:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:39,334 INFO L225 Difference]: With dead ends: 121 [2018-11-10 06:05:39,334 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 06:05:39,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:05:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 06:05:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-11-10 06:05:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 06:05:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-10 06:05:39,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 49 [2018-11-10 06:05:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:39,344 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-10 06:05:39,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 06:05:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-10 06:05:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 06:05:39,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:39,346 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:39,346 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:39,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash 190023432, now seen corresponding path program 3 times [2018-11-10 06:05:39,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:39,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:39,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:05:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 06:05:39,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:39,429 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:06:03,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 06:06:03,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:06:03,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:05,549 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~y~0_BEFORE_CALL_5 Int)) (let ((.cse1 (mod v_main_~y~0_BEFORE_CALL_5 2))) (let ((.cse0 (mod v_main_~y~0_BEFORE_CALL_5 4294967296)) (.cse2 (mod (+ .cse1 4294967294) 4294967296))) (and (< (mod (+ v_main_~y~0_BEFORE_CALL_5 4294967295) 4294967296) 268435455) (< .cse0 0) (not (= 0 .cse1)) (<= 268435455 .cse0) (= |c___VERIFIER_assert_#in~cond| .cse2) (<= .cse2 2147483647))))) (exists ((v_prenex_6 Int)) (let ((.cse3 (mod v_prenex_6 2))) (and (= .cse3 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< (mod (+ v_prenex_6 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_prenex_6 4294967296)) (= 0 .cse3) (< 2147483647 .cse3)))) (exists ((v_prenex_7 Int)) (let ((.cse5 (mod v_prenex_7 2)) (.cse4 (mod v_prenex_7 4294967296))) (and (<= 0 .cse4) (< (mod (+ v_prenex_7 4294967295) 4294967296) 268435455) (< 2147483647 .cse5) (= .cse5 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (<= 268435455 .cse4)))) (exists ((v_prenex_9 Int)) (let ((.cse8 (mod v_prenex_9 2))) (let ((.cse6 (mod (+ .cse8 4294967294) 4294967296)) (.cse7 (mod v_prenex_9 4294967296))) (and (= .cse6 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< 2147483647 .cse6) (<= 268435455 .cse7) (not (= 0 .cse8)) (< .cse7 0) (< (mod (+ v_prenex_9 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_8 Int)) (let ((.cse10 (mod v_prenex_8 4294967296)) (.cse9 (mod v_prenex_8 2))) (and (= |c___VERIFIER_assert_#in~cond| .cse9) (<= 268435455 .cse10) (<= 0 .cse10) (<= .cse9 2147483647) (< (mod (+ v_prenex_8 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_10 Int)) (let ((.cse11 (mod v_prenex_10 2))) (and (<= 268435455 (mod v_prenex_10 4294967296)) (<= .cse11 2147483647) (= 0 .cse11) (= |c___VERIFIER_assert_#in~cond| .cse11) (< (mod (+ v_prenex_10 4294967295) 4294967296) 268435455))))) is different from true [2018-11-10 06:06:07,565 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_8 Int)) (let ((.cse0 (mod v_prenex_8 4294967296)) (.cse1 (mod v_prenex_8 2))) (and (<= 268435455 .cse0) (<= 0 .cse0) (<= .cse1 2147483647) (= .cse1 c___VERIFIER_assert_~cond) (< (mod (+ v_prenex_8 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_9 Int)) (let ((.cse4 (mod v_prenex_9 2))) (let ((.cse2 (mod (+ .cse4 4294967294) 4294967296)) (.cse3 (mod v_prenex_9 4294967296))) (and (< 2147483647 .cse2) (<= 268435455 .cse3) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse2) (not (= 0 .cse4)) (< .cse3 0) (< (mod (+ v_prenex_9 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_10 Int)) (let ((.cse5 (mod v_prenex_10 2))) (and (<= 268435455 (mod v_prenex_10 4294967296)) (<= .cse5 2147483647) (= 0 .cse5) (< (mod (+ v_prenex_10 4294967295) 4294967296) 268435455) (= .cse5 c___VERIFIER_assert_~cond)))) (exists ((v_main_~y~0_BEFORE_CALL_5 Int)) (let ((.cse8 (mod v_main_~y~0_BEFORE_CALL_5 2))) (let ((.cse7 (mod v_main_~y~0_BEFORE_CALL_5 4294967296)) (.cse6 (mod (+ .cse8 4294967294) 4294967296))) (and (= .cse6 c___VERIFIER_assert_~cond) (< (mod (+ v_main_~y~0_BEFORE_CALL_5 4294967295) 4294967296) 268435455) (< .cse7 0) (not (= 0 .cse8)) (<= 268435455 .cse7) (<= .cse6 2147483647))))) (exists ((v_prenex_6 Int)) (let ((.cse9 (mod v_prenex_6 2))) (and (< (mod (+ v_prenex_6 4294967295) 4294967296) 268435455) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse9) (<= 268435455 (mod v_prenex_6 4294967296)) (= 0 .cse9) (< 2147483647 .cse9)))) (exists ((v_prenex_7 Int)) (let ((.cse11 (mod v_prenex_7 2)) (.cse10 (mod v_prenex_7 4294967296))) (and (<= 0 .cse10) (< (mod (+ v_prenex_7 4294967295) 4294967296) 268435455) (< 2147483647 .cse11) (= .cse11 (+ c___VERIFIER_assert_~cond 4294967296)) (<= 268435455 .cse10))))) is different from true [2018-11-10 06:06:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 06:06:11,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:06:11,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-10 06:06:11,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:06:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:06:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=51, Unknown=2, NotChecked=30, Total=110 [2018-11-10 06:06:11,614 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 11 states. [2018-11-10 06:06:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:11,700 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2018-11-10 06:06:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:06:11,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-11-10 06:06:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:11,702 INFO L225 Difference]: With dead ends: 151 [2018-11-10 06:06:11,702 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 06:06:11,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=34, Invalid=62, Unknown=2, NotChecked=34, Total=132 [2018-11-10 06:06:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 06:06:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-10 06:06:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 06:06:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-11-10 06:06:11,715 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 67 [2018-11-10 06:06:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:11,715 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-11-10 06:06:11,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:06:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-11-10 06:06:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 06:06:11,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:06:11,717 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 7, 6, 6, 6, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:06:11,717 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:06:11,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash 791159479, now seen corresponding path program 1 times [2018-11-10 06:06:11,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:06:11,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:06:11,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:06:11,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:06:11,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:06:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2018-11-10 06:06:11,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:06:11,845 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:06:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:11,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-10 06:06:11,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:06:11,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 6 [2018-11-10 06:06:11,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 06:06:11,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:06:11,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:06:11,956 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 6 states. [2018-11-10 06:06:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:12,015 INFO L93 Difference]: Finished difference Result 249 states and 285 transitions. [2018-11-10 06:06:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:06:12,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-10 06:06:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:12,017 INFO L225 Difference]: With dead ends: 249 [2018-11-10 06:06:12,017 INFO L226 Difference]: Without dead ends: 242 [2018-11-10 06:06:12,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:06:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-10 06:06:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 168. [2018-11-10 06:06:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-10 06:06:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2018-11-10 06:06:12,037 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 111 [2018-11-10 06:06:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:12,038 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2018-11-10 06:06:12,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 06:06:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2018-11-10 06:06:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 06:06:12,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:06:12,041 INFO L375 BasicCegarLoop]: trace histogram [50, 40, 13, 12, 12, 12, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:06:12,041 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:06:12,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash -407926660, now seen corresponding path program 2 times [2018-11-10 06:06:12,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:06:12,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:06:12,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:06:12,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:12,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:06:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2968 backedges. 24 proven. 1380 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-11-10 06:06:12,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:06:12,190 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:06:12,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:06:12,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:06:12,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:06:12,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2968 backedges. 476 proven. 20 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked. [2018-11-10 06:06:12,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:06:12,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2018-11-10 06:06:12,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:06:12,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:06:12,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:06:12,322 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand 11 states. [2018-11-10 06:06:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:12,696 INFO L93 Difference]: Finished difference Result 475 states and 551 transitions. [2018-11-10 06:06:12,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 06:06:12,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-11-10 06:06:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:12,698 INFO L225 Difference]: With dead ends: 475 [2018-11-10 06:06:12,698 INFO L226 Difference]: Without dead ends: 326 [2018-11-10 06:06:12,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-11-10 06:06:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-10 06:06:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 250. [2018-11-10 06:06:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 06:06:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2018-11-10 06:06:12,726 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 211 [2018-11-10 06:06:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:12,726 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2018-11-10 06:06:12,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:06:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2018-11-10 06:06:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-10 06:06:12,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:06:12,730 INFO L375 BasicCegarLoop]: trace histogram [78, 63, 19, 18, 18, 18, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:06:12,731 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:06:12,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:12,731 INFO L82 PathProgramCache]: Analyzing trace with hash 876120915, now seen corresponding path program 3 times [2018-11-10 06:06:12,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:06:12,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:06:12,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:06:12,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:06:12,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:06:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7188 backedges. 2990 proven. 590 refuted. 0 times theorem prover too weak. 3608 trivial. 0 not checked. [2018-11-10 06:06:12,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:06:12,961 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:06:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:06:12,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 06:06:12,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:06:12,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:31,253 WARN L179 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 198 DAG size of output: 23 [2018-11-10 06:06:33,262 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_20 Int)) (let ((.cse0 (mod v_prenex_20 4294967296)) (.cse1 (mod v_prenex_20 2))) (and (<= 0 .cse0) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (= .cse1 c___VERIFIER_assert_~cond) (<= .cse1 2147483647) (<= 268435455 .cse0) (< 2147483647 (mod (+ .cse1 4294967294) 4294967296))))) is different from false [2018-11-10 06:06:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7188 backedges. 2994 proven. 0 refuted. 0 times theorem prover too weak. 4194 trivial. 0 not checked. [2018-11-10 06:06:33,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:06:33,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-10 06:06:33,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 06:06:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 06:06:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=4, NotChecked=20, Total=156 [2018-11-10 06:06:33,317 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand 13 states. [2018-11-10 06:06:35,664 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_20 Int)) (let ((.cse0 (mod v_prenex_20 4294967296)) (.cse1 (mod v_prenex_20 2))) (and (<= 0 .cse0) (= .cse1 |c___VERIFIER_assert_#in~cond|) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (<= .cse1 2147483647) (<= 268435455 .cse0) (< 2147483647 (mod (+ .cse1 4294967294) 4294967296))))) (exists ((v_prenex_20 Int)) (let ((.cse2 (mod v_prenex_20 4294967296)) (.cse3 (mod v_prenex_20 2))) (and (<= 0 .cse2) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (= .cse3 c___VERIFIER_assert_~cond) (<= .cse3 2147483647) (<= 268435455 .cse2) (< 2147483647 (mod (+ .cse3 4294967294) 4294967296)))))) is different from false [2018-11-10 06:06:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:35,667 INFO L93 Difference]: Finished difference Result 495 states and 572 transitions. [2018-11-10 06:06:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 06:06:35,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 317 [2018-11-10 06:06:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:35,668 INFO L225 Difference]: With dead ends: 495 [2018-11-10 06:06:35,668 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 06:06:35,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=96, Invalid=507, Unknown=5, NotChecked=94, Total=702 [2018-11-10 06:06:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 06:06:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 06:06:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 06:06:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:06:35,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2018-11-10 06:06:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:35,670 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:06:35,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 06:06:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:06:35,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 06:06:35,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 06:06:35,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:35,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,188 WARN L179 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 233 [2018-11-10 06:06:36,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:06:36,487 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2018-11-10 06:06:37,274 WARN L179 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 37 [2018-11-10 06:06:37,745 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2018-11-10 06:06:37,748 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:06:37,748 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 06:06:37,748 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 33) no Hoare annotation was computed. [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-11-10 06:06:37,748 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-11-10 06:06:37,749 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse0 (<= 0 main_~z~0)) (.cse2 (<= main_~z~0 0)) (.cse1 (< (mod main_~y~0 4294967296) 268435455)) (.cse3 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse6 (<= main_~x~0 0)) (.cse11 (= main_~z~0 0)) (.cse7 (<= 0 main_~x~0)) (.cse4 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse8 (<= 0 main_~y~0)) (.cse5 (< (mod main_~x~0 4294967296) 268435455)) (.cse9 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse10 (<= main_~y~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse8 .cse6 .cse9 .cse7 .cse10) (and .cse4 .cse5 .cse1 .cse9 .cse3) (and .cse1 .cse9 .cse6 .cse7 .cse3) (and .cse4 .cse8 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse11 .cse7 .cse10) (and .cse4 .cse8 .cse5 .cse9 .cse10))) [2018-11-10 06:06:37,749 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse6 (<= 268435455 (mod main_~z~0 4294967296))) (.cse8 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455))) (let ((.cse1 (and .cse6 .cse8)) (.cse2 (< (mod main_~y~0 4294967296) 268435455)) (.cse7 (<= main_~x~0 0)) (.cse9 (<= 0 main_~x~0)) (.cse3 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse0 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse4 (< (mod main_~x~0 4294967296) 268435455)) (.cse5 (<= 0 main_~y~0)) (.cse10 (<= main_~y~0 0))) (or (and .cse0 (and .cse1 .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse7 .cse9 .cse3) (and .cse0 .cse4 (and .cse5 .cse6 .cse8) .cse10)))) [2018-11-10 06:06:37,749 INFO L421 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse4 (<= 268435455 (mod main_~z~0 4294967296))) (.cse6 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455))) (let ((.cse0 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse2 (< (mod main_~x~0 4294967296) 268435455)) (.cse8 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse1 (and (or (and .cse4 .cse6) (and (<= 0 main_~z~0) (<= main_~z~0 0))) (<= 0 main_~y~0))) (.cse5 (<= main_~x~0 0)) (.cse7 (<= 0 main_~x~0)) (.cse3 (<= main_~y~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse8) (and .cse1 .cse5 (= main_~z~0 0) .cse7 .cse3)))) [2018-11-10 06:06:37,749 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= 268435455 (mod main_~y~0 4294967296))) (.cse1 (<= 268435455 (mod main_~z~0 4294967296))) (.cse2 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse3 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) (or (and .cse0 .cse1 (<= main_~x~0 0) .cse2 (<= 0 main_~x~0) .cse3) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455) .cse0 .cse1 .cse2 .cse3))) [2018-11-10 06:06:37,749 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 33) no Hoare annotation was computed. [2018-11-10 06:06:37,749 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 33) the Hoare annotation is: true [2018-11-10 06:06:37,749 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-10 06:06:37,749 INFO L425 ceAbstractionStarter]: For program point L16-1(lines 16 30) no Hoare annotation was computed. [2018-11-10 06:06:37,750 INFO L421 ceAbstractionStarter]: At program point L16-3(lines 16 30) the Hoare annotation is: (or (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~y~0 4294967296)) (<= 268435455 (mod main_~z~0 4294967296)) (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455) (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (and (<= 0 main_~y~0) (<= main_~x~0 0) (= main_~z~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-11-10 06:06:37,750 INFO L421 ceAbstractionStarter]: At program point L16-4(lines 16 30) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~y~0 4294967296)) (<= 268435455 (mod main_~x~0 4294967296)) (<= 268435455 (mod main_~z~0 4294967296)) (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455) (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) [2018-11-10 06:06:37,750 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 06:06:37,750 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 06:06:37,750 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 06:06:37,750 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 06:06:37,750 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 06:06:37,750 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 06:06:37,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:06:37 BoogieIcfgContainer [2018-11-10 06:06:37,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:06:37,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:06:37,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:06:37,767 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:06:37,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:24" (3/4) ... [2018-11-10 06:06:37,771 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 06:06:37,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 06:06:37,778 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 06:06:37,778 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 06:06:37,781 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-10 06:06:37,781 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 06:06:37,781 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 06:06:37,815 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3287c729-5f42-41dc-adf0-35988b996497/bin-2019/uautomizer/witness.graphml [2018-11-10 06:06:37,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:06:37,816 INFO L168 Benchmark]: Toolchain (without parser) took 73688.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 954.8 MB in the beginning and 909.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 363.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:37,816 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:06:37,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.19 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 943.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:37,817 INFO L168 Benchmark]: Boogie Preprocessor took 19.03 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:06:37,817 INFO L168 Benchmark]: RCFGBuilder took 204.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:37,818 INFO L168 Benchmark]: TraceAbstraction took 73276.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 917.5 MB in the end (delta: 225.6 MB). Peak memory consumption was 446.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:37,818 INFO L168 Benchmark]: Witness Printer took 49.16 ms. Allocated memory is still 1.3 GB. Free memory was 917.5 MB in the beginning and 909.8 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:37,821 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.19 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 943.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.03 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73276.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 917.5 MB in the end (delta: 225.6 MB). Peak memory consumption was 446.7 MB. Max. memory is 11.5 GB. * Witness Printer took 49.16 ms. Allocated memory is still 1.3 GB. Free memory was 917.5 MB in the beginning and 909.8 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 21]: Loop Invariant Derived loop invariant: (((((((((((0 <= z && y % 4294967296 < 268435455) && z <= 0) && (y + 4294967295) % 4294967296 < 268435455) && (x + 4294967295) % 4294967296 < 268435455) && x % 4294967296 < 268435455) || (((((0 <= z && y % 4294967296 < 268435455) && z <= 0) && x <= 0) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || ((((0 <= y && x <= 0) && (z + 4294967295) % 4294967296 < 268435455) && 0 <= x) && y <= 0)) || (((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && y % 4294967296 < 268435455) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455)) || ((((y % 4294967296 < 268435455 && (z + 4294967295) % 4294967296 < 268435455) && x <= 0) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || (((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && z == 0) && y <= 0)) || ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0)) || (((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && (z + 4294967295) % 4294967296 < 268435455) && y <= 0) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (((((x + 4294967295) % 4294967296 < 268435455 && 268435455 <= y % 4294967296) && 268435455 <= z % 4294967296) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455) || ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((x + 4294967295) % 4294967296 < 268435455 && ((268435455 <= z % 4294967296 && (z + 4294967295) % 4294967296 < 268435455) || (0 <= z && z <= 0)) && 0 <= y) && x % 4294967296 < 268435455) && y <= 0) || ((((268435455 <= z % 4294967296 && x <= 0) && (z + 4294967295) % 4294967296 < 268435455) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || (((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && 268435455 <= z % 4294967296) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455)) || (((((((268435455 <= z % 4294967296 && (z + 4294967295) % 4294967296 < 268435455) || (0 <= z && z <= 0)) && 0 <= y) && x <= 0) && z == 0) && 0 <= x) && y <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 73.2s OverallTime, 13 OverallIterations, 78 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 493 SDtfs, 196 SDslu, 1732 SDs, 0 SdLazy, 1001 SolverSat, 76 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 828 SyntacticMatches, 18 SemanticMatches, 93 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 34.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 200 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 94 PreInvPairs, 252 NumberOfFragments, 627 HoareAnnotationTreeSize, 94 FomulaSimplifications, 20072 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 11 FomulaSimplificationsInter, 7173 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 24.3s SatisfiabilityAnalysisTime, 36.8s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1713 ConstructedInterpolants, 6 QuantifiedInterpolants, 991721 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1021 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 19984/22552 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...