java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:06:03,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:06:03,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:06:03,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:06:03,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:06:03,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:06:03,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:06:03,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:06:03,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:06:03,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:06:03,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:06:03,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:06:03,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:06:03,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:06:03,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:06:03,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:06:03,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:06:03,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:06:03,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:06:03,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:06:03,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:06:03,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:06:03,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:06:03,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:06:03,654 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:06:03,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:06:03,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:06:03,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:06:03,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:06:03,659 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:06:03,659 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:06:03,660 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:06:03,660 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:06:03,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:06:03,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:06:03,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:06:03,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:06:03,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:06:03,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:06:03,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:06:03,693 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:06:03,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:06:03,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:06:03,694 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:06:03,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:06:03,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:06:03,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:06:03,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:06:03,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:06:03,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:06:03,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:06:03,696 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:06:03,696 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:06:03,696 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:06:03,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:06:03,697 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:06:03,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:06:03,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:06:03,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:06:03,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:06:03,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:06:03,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:06:03,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:06:03,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:06:03,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:06:03,699 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:06:03,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:06:03,699 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:06:03,699 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:06:03,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:06:03,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:06:03,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:06:03,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:06:03,758 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:06:03,758 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:06:03,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:06:03,814 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aff93721/d341e374aa854fed8b524d65e3bd69ea/FLAG50a124d52 [2018-11-14 18:06:04,252 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:06:04,253 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:06:04,262 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aff93721/d341e374aa854fed8b524d65e3bd69ea/FLAG50a124d52 [2018-11-14 18:06:04,277 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aff93721/d341e374aa854fed8b524d65e3bd69ea [2018-11-14 18:06:04,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:06:04,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:06:04,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:06:04,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:06:04,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:06:04,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b77fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04, skipping insertion in model container [2018-11-14 18:06:04,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:06:04,340 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:06:04,615 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:06:04,621 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:06:04,661 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:06:04,678 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:06:04,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04 WrapperNode [2018-11-14 18:06:04,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:06:04,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:06:04,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:06:04,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:06:04,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... [2018-11-14 18:06:04,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:06:04,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:06:04,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:06:04,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:06:04,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-14 18:06:04,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:06:04,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:06:04,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:06:04,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:06:04,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:06:04,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:06:04,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:06:04,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:06:05,974 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:06:05,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:06:05 BoogieIcfgContainer [2018-11-14 18:06:05,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:06:05,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:06:05,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:06:05,980 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:06:05,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:06:04" (1/3) ... [2018-11-14 18:06:05,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bfe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:06:05, skipping insertion in model container [2018-11-14 18:06:05,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:04" (2/3) ... [2018-11-14 18:06:05,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bfe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:06:05, skipping insertion in model container [2018-11-14 18:06:05,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:06:05" (3/3) ... [2018-11-14 18:06:05,984 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:06:05,994 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:06:06,002 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:06:06,021 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:06:06,056 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:06:06,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:06:06,057 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:06:06,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:06:06,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:06:06,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:06:06,058 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:06:06,058 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:06:06,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:06:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-14 18:06:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:06:06,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:06,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:06,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:06,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash -26794943, now seen corresponding path program 1 times [2018-11-14 18:06:06,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:06,104 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:06,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:06,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:06,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-14 18:06:06,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 18:06:06,612 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #283#return; {63#true} is VALID [2018-11-14 18:06:06,613 INFO L256 TraceCheckUtils]: 3: Hoare triple {63#true} call #t~ret16 := main(); {63#true} is VALID [2018-11-14 18:06:06,613 INFO L273 TraceCheckUtils]: 4: Hoare triple {63#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2018-11-14 18:06:06,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 18:06:06,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {63#true} is VALID [2018-11-14 18:06:06,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {63#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {63#true} is VALID [2018-11-14 18:06:06,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {63#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,654 INFO L273 TraceCheckUtils]: 22: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:06,658 INFO L273 TraceCheckUtils]: 24: Hoare triple {92#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {64#false} is VALID [2018-11-14 18:06:06,658 INFO L273 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-14 18:06:06,667 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-14 18:06:06,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:06,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:06,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:06,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:06,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:06,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:06,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:06,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:06,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:06,789 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-11-14 18:06:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:07,884 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2018-11-14 18:06:07,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:07,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-14 18:06:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-14 18:06:07,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 212 transitions. [2018-11-14 18:06:08,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:08,565 INFO L225 Difference]: With dead ends: 119 [2018-11-14 18:06:08,565 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 18:06:08,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 18:06:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2018-11-14 18:06:08,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:08,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 71 states. [2018-11-14 18:06:08,626 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 71 states. [2018-11-14 18:06:08,627 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 71 states. [2018-11-14 18:06:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:08,638 INFO L93 Difference]: Finished difference Result 104 states and 190 transitions. [2018-11-14 18:06:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 190 transitions. [2018-11-14 18:06:08,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:08,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:08,640 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 104 states. [2018-11-14 18:06:08,640 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 104 states. [2018-11-14 18:06:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:08,650 INFO L93 Difference]: Finished difference Result 104 states and 190 transitions. [2018-11-14 18:06:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 190 transitions. [2018-11-14 18:06:08,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:08,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:08,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:08,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 18:06:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2018-11-14 18:06:08,660 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2018-11-14 18:06:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:08,661 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2018-11-14 18:06:08,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2018-11-14 18:06:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:06:08,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:08,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:08,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:08,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2020939649, now seen corresponding path program 1 times [2018-11-14 18:06:08,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:08,665 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:08,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:08,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:08,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {559#true} call ULTIMATE.init(); {559#true} is VALID [2018-11-14 18:06:08,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {559#true} assume true; {559#true} is VALID [2018-11-14 18:06:08,862 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {559#true} {559#true} #283#return; {559#true} is VALID [2018-11-14 18:06:08,863 INFO L256 TraceCheckUtils]: 3: Hoare triple {559#true} call #t~ret16 := main(); {559#true} is VALID [2018-11-14 18:06:08,863 INFO L273 TraceCheckUtils]: 4: Hoare triple {559#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {559#true} is VALID [2018-11-14 18:06:08,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {559#true} assume true; {559#true} is VALID [2018-11-14 18:06:08,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {559#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {559#true} is VALID [2018-11-14 18:06:08,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {559#true} is VALID [2018-11-14 18:06:08,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {559#true} assume !(~p1~0 != 0bv32); {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume !(~p13~0 != 0bv32); {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {588#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:08,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {588#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {560#false} is VALID [2018-11-14 18:06:08,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {560#false} assume ~lk1~0 != 1bv32; {560#false} is VALID [2018-11-14 18:06:08,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {560#false} assume !false; {560#false} is VALID [2018-11-14 18:06:08,883 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-14 18:06:08,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:08,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:08,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:08,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:08,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:08,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:08,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:08,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:08,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:08,950 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand 3 states. [2018-11-14 18:06:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,349 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2018-11-14 18:06:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:09,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:06:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2018-11-14 18:06:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2018-11-14 18:06:09,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 284 transitions. [2018-11-14 18:06:09,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:09,832 INFO L225 Difference]: With dead ends: 170 [2018-11-14 18:06:09,832 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 18:06:09,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 18:06:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-14 18:06:09,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:09,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-14 18:06:09,879 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-14 18:06:09,879 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-14 18:06:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,885 INFO L93 Difference]: Finished difference Result 104 states and 188 transitions. [2018-11-14 18:06:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2018-11-14 18:06:09,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:09,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:09,887 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-14 18:06:09,887 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-14 18:06:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,894 INFO L93 Difference]: Finished difference Result 104 states and 188 transitions. [2018-11-14 18:06:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2018-11-14 18:06:09,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:09,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:09,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:09,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-14 18:06:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 187 transitions. [2018-11-14 18:06:09,902 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 187 transitions. Word has length 26 [2018-11-14 18:06:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:09,902 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 187 transitions. [2018-11-14 18:06:09,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2018-11-14 18:06:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:06:09,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:09,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:09,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:09,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash -830431472, now seen corresponding path program 1 times [2018-11-14 18:06:09,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:09,905 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:09,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:10,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2018-11-14 18:06:10,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {1136#true} assume true; {1136#true} is VALID [2018-11-14 18:06:10,081 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1136#true} {1136#true} #283#return; {1136#true} is VALID [2018-11-14 18:06:10,081 INFO L256 TraceCheckUtils]: 3: Hoare triple {1136#true} call #t~ret16 := main(); {1136#true} is VALID [2018-11-14 18:06:10,081 INFO L273 TraceCheckUtils]: 4: Hoare triple {1136#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {1136#true} is VALID [2018-11-14 18:06:10,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {1136#true} assume true; {1136#true} is VALID [2018-11-14 18:06:10,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {1136#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {1136#true} is VALID [2018-11-14 18:06:10,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {1136#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {1136#true} is VALID [2018-11-14 18:06:10,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {1136#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume !(~p13~0 != 0bv32); {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {1165#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:10,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {1165#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {1137#false} is VALID [2018-11-14 18:06:10,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {1137#false} assume ~p2~0 != 0bv32; {1137#false} is VALID [2018-11-14 18:06:10,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {1137#false} assume ~lk2~0 != 1bv32; {1137#false} is VALID [2018-11-14 18:06:10,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2018-11-14 18:06:10,110 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-14 18:06:10,111 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:10,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:10,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:10,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:10,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:10,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:10,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:10,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:10,153 INFO L87 Difference]: Start difference. First operand 102 states and 187 transitions. Second operand 3 states. [2018-11-14 18:06:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,462 INFO L93 Difference]: Finished difference Result 157 states and 283 transitions. [2018-11-14 18:06:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:10,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2018-11-14 18:06:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2018-11-14 18:06:10,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 279 transitions. [2018-11-14 18:06:10,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:10,811 INFO L225 Difference]: With dead ends: 157 [2018-11-14 18:06:10,811 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 18:06:10,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 18:06:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-14 18:06:10,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:10,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 106 states. [2018-11-14 18:06:10,838 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 106 states. [2018-11-14 18:06:10,839 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 106 states. [2018-11-14 18:06:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,844 INFO L93 Difference]: Finished difference Result 108 states and 191 transitions. [2018-11-14 18:06:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 191 transitions. [2018-11-14 18:06:10,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:10,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:10,845 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 108 states. [2018-11-14 18:06:10,846 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 108 states. [2018-11-14 18:06:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,851 INFO L93 Difference]: Finished difference Result 108 states and 191 transitions. [2018-11-14 18:06:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 191 transitions. [2018-11-14 18:06:10,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:10,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:10,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:10,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-14 18:06:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 190 transitions. [2018-11-14 18:06:10,858 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 190 transitions. Word has length 27 [2018-11-14 18:06:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:10,859 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 190 transitions. [2018-11-14 18:06:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 190 transitions. [2018-11-14 18:06:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:06:10,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:10,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:10,860 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:10,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1775592082, now seen corresponding path program 1 times [2018-11-14 18:06:10,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:10,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:10,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:10,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:11,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {1717#true} call ULTIMATE.init(); {1717#true} is VALID [2018-11-14 18:06:11,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 18:06:11,007 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1717#true} {1717#true} #283#return; {1717#true} is VALID [2018-11-14 18:06:11,007 INFO L256 TraceCheckUtils]: 3: Hoare triple {1717#true} call #t~ret16 := main(); {1717#true} is VALID [2018-11-14 18:06:11,007 INFO L273 TraceCheckUtils]: 4: Hoare triple {1717#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {1717#true} is VALID [2018-11-14 18:06:11,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-14 18:06:11,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {1717#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {1717#true} is VALID [2018-11-14 18:06:11,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {1717#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {1717#true} is VALID [2018-11-14 18:06:11,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {1717#true} assume !(~p1~0 != 0bv32); {1717#true} is VALID [2018-11-14 18:06:11,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {1717#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {1749#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1718#false} is VALID [2018-11-14 18:06:11,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {1718#false} assume !false; {1718#false} is VALID [2018-11-14 18:06:11,026 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-14 18:06:11,027 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:11,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:11,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:11,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:11,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:11,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,084 INFO L87 Difference]: Start difference. First operand 106 states and 190 transitions. Second operand 3 states. [2018-11-14 18:06:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,357 INFO L93 Difference]: Finished difference Result 201 states and 365 transitions. [2018-11-14 18:06:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:11,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 18:06:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 18:06:11,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-14 18:06:11,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,647 INFO L225 Difference]: With dead ends: 201 [2018-11-14 18:06:11,647 INFO L226 Difference]: Without dead ends: 199 [2018-11-14 18:06:11,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-14 18:06:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 139. [2018-11-14 18:06:11,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:11,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 139 states. [2018-11-14 18:06:11,694 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 139 states. [2018-11-14 18:06:11,694 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 139 states. [2018-11-14 18:06:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,703 INFO L93 Difference]: Finished difference Result 199 states and 362 transitions. [2018-11-14 18:06:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 362 transitions. [2018-11-14 18:06:11,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:11,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:11,704 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 199 states. [2018-11-14 18:06:11,704 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 199 states. [2018-11-14 18:06:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,713 INFO L93 Difference]: Finished difference Result 199 states and 362 transitions. [2018-11-14 18:06:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 362 transitions. [2018-11-14 18:06:11,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:11,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:11,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 18:06:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 251 transitions. [2018-11-14 18:06:11,721 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 251 transitions. Word has length 27 [2018-11-14 18:06:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:11,721 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 251 transitions. [2018-11-14 18:06:11,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 251 transitions. [2018-11-14 18:06:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:06:11,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:11,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:11,723 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:11,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -218552624, now seen corresponding path program 1 times [2018-11-14 18:06:11,723 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:11,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:11,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:11,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2018-11-14 18:06:11,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {2558#true} assume true; {2558#true} is VALID [2018-11-14 18:06:11,871 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2558#true} {2558#true} #283#return; {2558#true} is VALID [2018-11-14 18:06:11,871 INFO L256 TraceCheckUtils]: 3: Hoare triple {2558#true} call #t~ret16 := main(); {2558#true} is VALID [2018-11-14 18:06:11,871 INFO L273 TraceCheckUtils]: 4: Hoare triple {2558#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {2558#true} is VALID [2018-11-14 18:06:11,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {2558#true} assume true; {2558#true} is VALID [2018-11-14 18:06:11,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {2558#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {2558#true} is VALID [2018-11-14 18:06:11,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {2558#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {2558#true} is VALID [2018-11-14 18:06:11,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(~p1~0 != 0bv32); {2558#true} is VALID [2018-11-14 18:06:11,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {2558#true} assume !(~p2~0 != 0bv32); {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume !(~p13~0 != 0bv32); {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {2590#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:11,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {2590#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {2559#false} is VALID [2018-11-14 18:06:11,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {2559#false} assume ~lk2~0 != 1bv32; {2559#false} is VALID [2018-11-14 18:06:11,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2018-11-14 18:06:11,940 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-14 18:06:11,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:11,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:11,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:11,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:11,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:11,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:11,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:11,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,977 INFO L87 Difference]: Start difference. First operand 139 states and 251 transitions. Second operand 3 states. [2018-11-14 18:06:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,549 INFO L93 Difference]: Finished difference Result 331 states and 605 transitions. [2018-11-14 18:06:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:12,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2018-11-14 18:06:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2018-11-14 18:06:12,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 281 transitions. [2018-11-14 18:06:12,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:12,969 INFO L225 Difference]: With dead ends: 331 [2018-11-14 18:06:12,970 INFO L226 Difference]: Without dead ends: 201 [2018-11-14 18:06:12,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-14 18:06:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-14 18:06:13,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:13,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 199 states. [2018-11-14 18:06:13,004 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 199 states. [2018-11-14 18:06:13,005 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 199 states. [2018-11-14 18:06:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,028 INFO L93 Difference]: Finished difference Result 201 states and 360 transitions. [2018-11-14 18:06:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 360 transitions. [2018-11-14 18:06:13,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,029 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 201 states. [2018-11-14 18:06:13,029 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 201 states. [2018-11-14 18:06:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,043 INFO L93 Difference]: Finished difference Result 201 states and 360 transitions. [2018-11-14 18:06:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 360 transitions. [2018-11-14 18:06:13,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:13,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-14 18:06:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 359 transitions. [2018-11-14 18:06:13,051 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 359 transitions. Word has length 27 [2018-11-14 18:06:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:13,052 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 359 transitions. [2018-11-14 18:06:13,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 359 transitions. [2018-11-14 18:06:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:13,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:13,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:13,053 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:13,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash -791008204, now seen corresponding path program 1 times [2018-11-14 18:06:13,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:13,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:13,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {3597#true} call ULTIMATE.init(); {3597#true} is VALID [2018-11-14 18:06:13,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {3597#true} assume true; {3597#true} is VALID [2018-11-14 18:06:13,407 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3597#true} {3597#true} #283#return; {3597#true} is VALID [2018-11-14 18:06:13,407 INFO L256 TraceCheckUtils]: 3: Hoare triple {3597#true} call #t~ret16 := main(); {3597#true} is VALID [2018-11-14 18:06:13,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {3597#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {3597#true} is VALID [2018-11-14 18:06:13,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {3597#true} assume true; {3597#true} is VALID [2018-11-14 18:06:13,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {3597#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {3597#true} is VALID [2018-11-14 18:06:13,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {3597#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {3597#true} is VALID [2018-11-14 18:06:13,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {3597#true} assume !(~p1~0 != 0bv32); {3597#true} is VALID [2018-11-14 18:06:13,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {3597#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,417 INFO L273 TraceCheckUtils]: 15: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,419 INFO L273 TraceCheckUtils]: 17: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume !(~p13~0 != 0bv32); {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {3629#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {3629#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {3598#false} is VALID [2018-11-14 18:06:13,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {3598#false} assume ~p3~0 != 0bv32; {3598#false} is VALID [2018-11-14 18:06:13,423 INFO L273 TraceCheckUtils]: 26: Hoare triple {3598#false} assume ~lk3~0 != 1bv32; {3598#false} is VALID [2018-11-14 18:06:13,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {3598#false} assume !false; {3598#false} is VALID [2018-11-14 18:06:13,424 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-14 18:06:13,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:13,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:13,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:13,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:13,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,459 INFO L87 Difference]: Start difference. First operand 199 states and 359 transitions. Second operand 3 states. [2018-11-14 18:06:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,876 INFO L93 Difference]: Finished difference Result 298 states and 536 transitions. [2018-11-14 18:06:13,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:13,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2018-11-14 18:06:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2018-11-14 18:06:13,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 276 transitions. [2018-11-14 18:06:14,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:14,281 INFO L225 Difference]: With dead ends: 298 [2018-11-14 18:06:14,281 INFO L226 Difference]: Without dead ends: 203 [2018-11-14 18:06:14,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-14 18:06:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-14 18:06:14,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:14,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 201 states. [2018-11-14 18:06:14,325 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 201 states. [2018-11-14 18:06:14,325 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 201 states. [2018-11-14 18:06:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,331 INFO L93 Difference]: Finished difference Result 203 states and 360 transitions. [2018-11-14 18:06:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 360 transitions. [2018-11-14 18:06:14,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:14,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:14,332 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 203 states. [2018-11-14 18:06:14,333 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 203 states. [2018-11-14 18:06:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,338 INFO L93 Difference]: Finished difference Result 203 states and 360 transitions. [2018-11-14 18:06:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 360 transitions. [2018-11-14 18:06:14,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:14,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:14,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:14,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-14 18:06:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 359 transitions. [2018-11-14 18:06:14,344 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 359 transitions. Word has length 28 [2018-11-14 18:06:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:14,345 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 359 transitions. [2018-11-14 18:06:14,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 359 transitions. [2018-11-14 18:06:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:14,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:14,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:14,346 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:14,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:14,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1815015350, now seen corresponding path program 1 times [2018-11-14 18:06:14,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:14,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:14,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:14,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:14,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {4612#true} call ULTIMATE.init(); {4612#true} is VALID [2018-11-14 18:06:14,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {4612#true} assume true; {4612#true} is VALID [2018-11-14 18:06:14,642 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4612#true} {4612#true} #283#return; {4612#true} is VALID [2018-11-14 18:06:14,642 INFO L256 TraceCheckUtils]: 3: Hoare triple {4612#true} call #t~ret16 := main(); {4612#true} is VALID [2018-11-14 18:06:14,643 INFO L273 TraceCheckUtils]: 4: Hoare triple {4612#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {4612#true} is VALID [2018-11-14 18:06:14,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {4612#true} assume true; {4612#true} is VALID [2018-11-14 18:06:14,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {4612#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {4612#true} is VALID [2018-11-14 18:06:14,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {4612#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {4612#true} is VALID [2018-11-14 18:06:14,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {4612#true} assume !(~p1~0 != 0bv32); {4612#true} is VALID [2018-11-14 18:06:14,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {4612#true} assume !(~p2~0 != 0bv32); {4612#true} is VALID [2018-11-14 18:06:14,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {4612#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:14,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {4647#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {4613#false} is VALID [2018-11-14 18:06:14,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {4613#false} assume !false; {4613#false} is VALID [2018-11-14 18:06:14,691 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-14 18:06:14,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:14,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:14,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:14,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:14,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:14,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:14,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:14,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:14,723 INFO L87 Difference]: Start difference. First operand 201 states and 359 transitions. Second operand 3 states. [2018-11-14 18:06:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,261 INFO L93 Difference]: Finished difference Result 381 states and 689 transitions. [2018-11-14 18:06:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:15,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2018-11-14 18:06:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2018-11-14 18:06:15,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 184 transitions. [2018-11-14 18:06:15,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:15,877 INFO L225 Difference]: With dead ends: 381 [2018-11-14 18:06:15,877 INFO L226 Difference]: Without dead ends: 379 [2018-11-14 18:06:15,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-14 18:06:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 269. [2018-11-14 18:06:16,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:16,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand 269 states. [2018-11-14 18:06:16,035 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand 269 states. [2018-11-14 18:06:16,035 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 269 states. [2018-11-14 18:06:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:16,046 INFO L93 Difference]: Finished difference Result 379 states and 684 transitions. [2018-11-14 18:06:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 684 transitions. [2018-11-14 18:06:16,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:16,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:16,048 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 379 states. [2018-11-14 18:06:16,048 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 379 states. [2018-11-14 18:06:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:16,059 INFO L93 Difference]: Finished difference Result 379 states and 684 transitions. [2018-11-14 18:06:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 684 transitions. [2018-11-14 18:06:16,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:16,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:16,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:16,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-14 18:06:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 479 transitions. [2018-11-14 18:06:16,068 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 479 transitions. Word has length 28 [2018-11-14 18:06:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:16,068 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 479 transitions. [2018-11-14 18:06:16,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 479 transitions. [2018-11-14 18:06:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:16,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:16,070 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:16,070 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:16,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash -179129356, now seen corresponding path program 1 times [2018-11-14 18:06:16,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:16,071 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:16,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:16,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:16,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {6132#true} call ULTIMATE.init(); {6132#true} is VALID [2018-11-14 18:06:16,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {6132#true} assume true; {6132#true} is VALID [2018-11-14 18:06:16,691 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6132#true} {6132#true} #283#return; {6132#true} is VALID [2018-11-14 18:06:16,692 INFO L256 TraceCheckUtils]: 3: Hoare triple {6132#true} call #t~ret16 := main(); {6132#true} is VALID [2018-11-14 18:06:16,692 INFO L273 TraceCheckUtils]: 4: Hoare triple {6132#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {6132#true} is VALID [2018-11-14 18:06:16,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {6132#true} assume true; {6132#true} is VALID [2018-11-14 18:06:16,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {6132#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {6132#true} is VALID [2018-11-14 18:06:16,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {6132#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {6132#true} is VALID [2018-11-14 18:06:16,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {6132#true} assume !(~p1~0 != 0bv32); {6132#true} is VALID [2018-11-14 18:06:16,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {6132#true} assume !(~p2~0 != 0bv32); {6132#true} is VALID [2018-11-14 18:06:16,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {6132#true} assume !(~p3~0 != 0bv32); {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume !(~p13~0 != 0bv32); {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {6167#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:16,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {6167#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {6133#false} is VALID [2018-11-14 18:06:16,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {6133#false} assume ~lk3~0 != 1bv32; {6133#false} is VALID [2018-11-14 18:06:16,715 INFO L273 TraceCheckUtils]: 27: Hoare triple {6133#false} assume !false; {6133#false} is VALID [2018-11-14 18:06:16,716 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-14 18:06:16,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:16,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:16,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:16,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:16,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:16,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:16,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:16,745 INFO L87 Difference]: Start difference. First operand 269 states and 479 transitions. Second operand 3 states. [2018-11-14 18:06:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:17,248 INFO L93 Difference]: Finished difference Result 645 states and 1157 transitions. [2018-11-14 18:06:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:17,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2018-11-14 18:06:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2018-11-14 18:06:17,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 278 transitions. [2018-11-14 18:06:17,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:17,972 INFO L225 Difference]: With dead ends: 645 [2018-11-14 18:06:17,972 INFO L226 Difference]: Without dead ends: 387 [2018-11-14 18:06:17,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-14 18:06:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-11-14 18:06:18,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:18,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand 385 states. [2018-11-14 18:06:18,084 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand 385 states. [2018-11-14 18:06:18,084 INFO L87 Difference]: Start difference. First operand 387 states. Second operand 385 states. [2018-11-14 18:06:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,096 INFO L93 Difference]: Finished difference Result 387 states and 684 transitions. [2018-11-14 18:06:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 684 transitions. [2018-11-14 18:06:18,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:18,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:18,098 INFO L74 IsIncluded]: Start isIncluded. First operand 385 states. Second operand 387 states. [2018-11-14 18:06:18,098 INFO L87 Difference]: Start difference. First operand 385 states. Second operand 387 states. [2018-11-14 18:06:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,112 INFO L93 Difference]: Finished difference Result 387 states and 684 transitions. [2018-11-14 18:06:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 684 transitions. [2018-11-14 18:06:18,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:18,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:18,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:18,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-14 18:06:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 683 transitions. [2018-11-14 18:06:18,126 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 683 transitions. Word has length 28 [2018-11-14 18:06:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:18,127 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 683 transitions. [2018-11-14 18:06:18,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 683 transitions. [2018-11-14 18:06:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:18,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:18,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:18,128 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:18,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 431113445, now seen corresponding path program 1 times [2018-11-14 18:06:18,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:18,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:18,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:18,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {8056#true} call ULTIMATE.init(); {8056#true} is VALID [2018-11-14 18:06:18,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {8056#true} assume true; {8056#true} is VALID [2018-11-14 18:06:18,509 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8056#true} {8056#true} #283#return; {8056#true} is VALID [2018-11-14 18:06:18,509 INFO L256 TraceCheckUtils]: 3: Hoare triple {8056#true} call #t~ret16 := main(); {8056#true} is VALID [2018-11-14 18:06:18,510 INFO L273 TraceCheckUtils]: 4: Hoare triple {8056#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {8056#true} is VALID [2018-11-14 18:06:18,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {8056#true} assume true; {8056#true} is VALID [2018-11-14 18:06:18,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {8056#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {8056#true} is VALID [2018-11-14 18:06:18,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {8056#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {8056#true} is VALID [2018-11-14 18:06:18,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {8056#true} assume !(~p1~0 != 0bv32); {8056#true} is VALID [2018-11-14 18:06:18,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {8056#true} assume !(~p2~0 != 0bv32); {8056#true} is VALID [2018-11-14 18:06:18,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {8056#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume !(~p13~0 != 0bv32); {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {8091#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:18,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {8091#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {8057#false} is VALID [2018-11-14 18:06:18,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {8057#false} assume ~p4~0 != 0bv32; {8057#false} is VALID [2018-11-14 18:06:18,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {8057#false} assume ~lk4~0 != 1bv32; {8057#false} is VALID [2018-11-14 18:06:18,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {8057#false} assume !false; {8057#false} is VALID [2018-11-14 18:06:18,525 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-14 18:06:18,525 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:18,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:18,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:18,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:18,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:18,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:18,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:18,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:18,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:18,580 INFO L87 Difference]: Start difference. First operand 385 states and 683 transitions. Second operand 3 states. [2018-11-14 18:06:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,852 INFO L93 Difference]: Finished difference Result 577 states and 1021 transitions. [2018-11-14 18:06:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:18,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2018-11-14 18:06:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2018-11-14 18:06:18,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2018-11-14 18:06:19,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:19,581 INFO L225 Difference]: With dead ends: 577 [2018-11-14 18:06:19,582 INFO L226 Difference]: Without dead ends: 391 [2018-11-14 18:06:19,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-14 18:06:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-11-14 18:06:19,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:19,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand 389 states. [2018-11-14 18:06:19,806 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand 389 states. [2018-11-14 18:06:19,806 INFO L87 Difference]: Start difference. First operand 391 states. Second operand 389 states. [2018-11-14 18:06:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:19,818 INFO L93 Difference]: Finished difference Result 391 states and 684 transitions. [2018-11-14 18:06:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 684 transitions. [2018-11-14 18:06:19,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:19,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:19,820 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand 391 states. [2018-11-14 18:06:19,820 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 391 states. [2018-11-14 18:06:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:19,832 INFO L93 Difference]: Finished difference Result 391 states and 684 transitions. [2018-11-14 18:06:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 684 transitions. [2018-11-14 18:06:19,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:19,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:19,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:19,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-14 18:06:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 683 transitions. [2018-11-14 18:06:19,848 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 683 transitions. Word has length 29 [2018-11-14 18:06:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:19,848 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 683 transitions. [2018-11-14 18:06:19,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 683 transitions. [2018-11-14 18:06:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:19,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:19,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:19,850 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:19,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:19,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1257830297, now seen corresponding path program 1 times [2018-11-14 18:06:19,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:19,851 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:19,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:20,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {9927#true} call ULTIMATE.init(); {9927#true} is VALID [2018-11-14 18:06:20,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {9927#true} assume true; {9927#true} is VALID [2018-11-14 18:06:20,364 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9927#true} {9927#true} #283#return; {9927#true} is VALID [2018-11-14 18:06:20,364 INFO L256 TraceCheckUtils]: 3: Hoare triple {9927#true} call #t~ret16 := main(); {9927#true} is VALID [2018-11-14 18:06:20,364 INFO L273 TraceCheckUtils]: 4: Hoare triple {9927#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {9927#true} is VALID [2018-11-14 18:06:20,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {9927#true} assume true; {9927#true} is VALID [2018-11-14 18:06:20,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {9927#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {9927#true} is VALID [2018-11-14 18:06:20,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {9927#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {9927#true} is VALID [2018-11-14 18:06:20,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {9927#true} assume !(~p1~0 != 0bv32); {9927#true} is VALID [2018-11-14 18:06:20,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {9927#true} assume !(~p2~0 != 0bv32); {9927#true} is VALID [2018-11-14 18:06:20,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {9927#true} assume !(~p3~0 != 0bv32); {9927#true} is VALID [2018-11-14 18:06:20,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {9927#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,375 INFO L273 TraceCheckUtils]: 22: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:20,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {9965#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {9928#false} is VALID [2018-11-14 18:06:20,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {9928#false} assume !false; {9928#false} is VALID [2018-11-14 18:06:20,379 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-14 18:06:20,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:20,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:20,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:20,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:20,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:20,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:20,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:20,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:20,415 INFO L87 Difference]: Start difference. First operand 389 states and 683 transitions. Second operand 3 states. [2018-11-14 18:06:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:21,429 INFO L93 Difference]: Finished difference Result 733 states and 1305 transitions. [2018-11-14 18:06:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:21,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-14 18:06:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-14 18:06:21,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2018-11-14 18:06:22,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:22,075 INFO L225 Difference]: With dead ends: 733 [2018-11-14 18:06:22,076 INFO L226 Difference]: Without dead ends: 731 [2018-11-14 18:06:22,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-14 18:06:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 529. [2018-11-14 18:06:22,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:22,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 731 states. Second operand 529 states. [2018-11-14 18:06:22,168 INFO L74 IsIncluded]: Start isIncluded. First operand 731 states. Second operand 529 states. [2018-11-14 18:06:22,168 INFO L87 Difference]: Start difference. First operand 731 states. Second operand 529 states. [2018-11-14 18:06:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:22,191 INFO L93 Difference]: Finished difference Result 731 states and 1296 transitions. [2018-11-14 18:06:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1296 transitions. [2018-11-14 18:06:22,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:22,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:22,193 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand 731 states. [2018-11-14 18:06:22,193 INFO L87 Difference]: Start difference. First operand 529 states. Second operand 731 states. [2018-11-14 18:06:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:22,222 INFO L93 Difference]: Finished difference Result 731 states and 1296 transitions. [2018-11-14 18:06:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1296 transitions. [2018-11-14 18:06:22,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:22,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:22,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:22,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-14 18:06:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 919 transitions. [2018-11-14 18:06:22,243 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 919 transitions. Word has length 29 [2018-11-14 18:06:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:22,243 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 919 transitions. [2018-11-14 18:06:22,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 919 transitions. [2018-11-14 18:06:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:22,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:22,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:22,245 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:22,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1042992293, now seen corresponding path program 1 times [2018-11-14 18:06:22,246 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:22,246 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:22,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:22,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {12778#true} call ULTIMATE.init(); {12778#true} is VALID [2018-11-14 18:06:22,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {12778#true} assume true; {12778#true} is VALID [2018-11-14 18:06:22,415 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12778#true} {12778#true} #283#return; {12778#true} is VALID [2018-11-14 18:06:22,415 INFO L256 TraceCheckUtils]: 3: Hoare triple {12778#true} call #t~ret16 := main(); {12778#true} is VALID [2018-11-14 18:06:22,415 INFO L273 TraceCheckUtils]: 4: Hoare triple {12778#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {12778#true} is VALID [2018-11-14 18:06:22,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {12778#true} assume true; {12778#true} is VALID [2018-11-14 18:06:22,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {12778#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {12778#true} is VALID [2018-11-14 18:06:22,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {12778#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {12778#true} is VALID [2018-11-14 18:06:22,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {12778#true} assume !(~p1~0 != 0bv32); {12778#true} is VALID [2018-11-14 18:06:22,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {12778#true} assume !(~p2~0 != 0bv32); {12778#true} is VALID [2018-11-14 18:06:22,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {12778#true} assume !(~p3~0 != 0bv32); {12778#true} is VALID [2018-11-14 18:06:22,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {12778#true} assume !(~p4~0 != 0bv32); {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume !(~p13~0 != 0bv32); {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {12816#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:22,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {12816#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {12779#false} is VALID [2018-11-14 18:06:22,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {12779#false} assume ~lk4~0 != 1bv32; {12779#false} is VALID [2018-11-14 18:06:22,436 INFO L273 TraceCheckUtils]: 28: Hoare triple {12779#false} assume !false; {12779#false} is VALID [2018-11-14 18:06:22,437 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-14 18:06:22,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:22,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:22,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:22,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:22,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:22,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:22,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:22,489 INFO L87 Difference]: Start difference. First operand 529 states and 919 transitions. Second operand 3 states. [2018-11-14 18:06:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:23,606 INFO L93 Difference]: Finished difference Result 1269 states and 2217 transitions. [2018-11-14 18:06:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:23,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2018-11-14 18:06:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2018-11-14 18:06:23,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 275 transitions. [2018-11-14 18:06:23,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:23,940 INFO L225 Difference]: With dead ends: 1269 [2018-11-14 18:06:23,940 INFO L226 Difference]: Without dead ends: 755 [2018-11-14 18:06:23,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-14 18:06:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-11-14 18:06:24,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:24,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 755 states. Second operand 753 states. [2018-11-14 18:06:24,205 INFO L74 IsIncluded]: Start isIncluded. First operand 755 states. Second operand 753 states. [2018-11-14 18:06:24,206 INFO L87 Difference]: Start difference. First operand 755 states. Second operand 753 states. [2018-11-14 18:06:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:24,236 INFO L93 Difference]: Finished difference Result 755 states and 1304 transitions. [2018-11-14 18:06:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1304 transitions. [2018-11-14 18:06:24,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:24,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:24,238 INFO L74 IsIncluded]: Start isIncluded. First operand 753 states. Second operand 755 states. [2018-11-14 18:06:24,238 INFO L87 Difference]: Start difference. First operand 753 states. Second operand 755 states. [2018-11-14 18:06:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:24,267 INFO L93 Difference]: Finished difference Result 755 states and 1304 transitions. [2018-11-14 18:06:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1304 transitions. [2018-11-14 18:06:24,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:24,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:24,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:24,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-14 18:06:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1303 transitions. [2018-11-14 18:06:24,294 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1303 transitions. Word has length 29 [2018-11-14 18:06:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:24,295 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1303 transitions. [2018-11-14 18:06:24,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1303 transitions. [2018-11-14 18:06:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:24,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:24,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:24,296 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:24,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash -337820759, now seen corresponding path program 1 times [2018-11-14 18:06:24,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:24,297 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:24,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:24,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:24,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {16453#true} call ULTIMATE.init(); {16453#true} is VALID [2018-11-14 18:06:24,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {16453#true} assume true; {16453#true} is VALID [2018-11-14 18:06:24,434 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16453#true} {16453#true} #283#return; {16453#true} is VALID [2018-11-14 18:06:24,434 INFO L256 TraceCheckUtils]: 3: Hoare triple {16453#true} call #t~ret16 := main(); {16453#true} is VALID [2018-11-14 18:06:24,434 INFO L273 TraceCheckUtils]: 4: Hoare triple {16453#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {16453#true} is VALID [2018-11-14 18:06:24,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {16453#true} assume true; {16453#true} is VALID [2018-11-14 18:06:24,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {16453#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {16453#true} is VALID [2018-11-14 18:06:24,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {16453#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {16453#true} is VALID [2018-11-14 18:06:24,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {16453#true} assume !(~p1~0 != 0bv32); {16453#true} is VALID [2018-11-14 18:06:24,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {16453#true} assume !(~p2~0 != 0bv32); {16453#true} is VALID [2018-11-14 18:06:24,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {16453#true} assume !(~p3~0 != 0bv32); {16453#true} is VALID [2018-11-14 18:06:24,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {16453#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume !(~p13~0 != 0bv32); {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,446 INFO L273 TraceCheckUtils]: 23: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {16491#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:24,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {16491#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {16454#false} is VALID [2018-11-14 18:06:24,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {16454#false} assume ~p5~0 != 0bv32; {16454#false} is VALID [2018-11-14 18:06:24,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {16454#false} assume ~lk5~0 != 1bv32; {16454#false} is VALID [2018-11-14 18:06:24,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {16454#false} assume !false; {16454#false} is VALID [2018-11-14 18:06:24,458 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-14 18:06:24,458 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:24,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:24,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:24,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:24,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:24,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:24,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:24,498 INFO L87 Difference]: Start difference. First operand 753 states and 1303 transitions. Second operand 3 states. [2018-11-14 18:06:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:25,267 INFO L93 Difference]: Finished difference Result 1129 states and 1949 transitions. [2018-11-14 18:06:25,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:25,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2018-11-14 18:06:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2018-11-14 18:06:25,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 270 transitions. [2018-11-14 18:06:25,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:25,547 INFO L225 Difference]: With dead ends: 1129 [2018-11-14 18:06:25,547 INFO L226 Difference]: Without dead ends: 763 [2018-11-14 18:06:25,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-14 18:06:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2018-11-14 18:06:25,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:25,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 763 states. Second operand 761 states. [2018-11-14 18:06:25,735 INFO L74 IsIncluded]: Start isIncluded. First operand 763 states. Second operand 761 states. [2018-11-14 18:06:25,735 INFO L87 Difference]: Start difference. First operand 763 states. Second operand 761 states. [2018-11-14 18:06:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:25,759 INFO L93 Difference]: Finished difference Result 763 states and 1304 transitions. [2018-11-14 18:06:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1304 transitions. [2018-11-14 18:06:25,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:25,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:25,760 INFO L74 IsIncluded]: Start isIncluded. First operand 761 states. Second operand 763 states. [2018-11-14 18:06:25,760 INFO L87 Difference]: Start difference. First operand 761 states. Second operand 763 states. [2018-11-14 18:06:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:25,789 INFO L93 Difference]: Finished difference Result 763 states and 1304 transitions. [2018-11-14 18:06:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1304 transitions. [2018-11-14 18:06:25,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:25,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:25,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:25,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-14 18:06:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1303 transitions. [2018-11-14 18:06:25,810 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1303 transitions. Word has length 30 [2018-11-14 18:06:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:25,810 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1303 transitions. [2018-11-14 18:06:25,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1303 transitions. [2018-11-14 18:06:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:25,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:25,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:25,811 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:25,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:25,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764501, now seen corresponding path program 1 times [2018-11-14 18:06:25,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:25,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:25,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:25,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:25,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {20015#true} call ULTIMATE.init(); {20015#true} is VALID [2018-11-14 18:06:25,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {20015#true} assume true; {20015#true} is VALID [2018-11-14 18:06:25,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20015#true} {20015#true} #283#return; {20015#true} is VALID [2018-11-14 18:06:25,908 INFO L256 TraceCheckUtils]: 3: Hoare triple {20015#true} call #t~ret16 := main(); {20015#true} is VALID [2018-11-14 18:06:25,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {20015#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {20015#true} is VALID [2018-11-14 18:06:25,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {20015#true} assume true; {20015#true} is VALID [2018-11-14 18:06:25,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {20015#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {20015#true} is VALID [2018-11-14 18:06:25,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {20015#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {20015#true} is VALID [2018-11-14 18:06:25,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {20015#true} assume !(~p1~0 != 0bv32); {20015#true} is VALID [2018-11-14 18:06:25,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {20015#true} assume !(~p2~0 != 0bv32); {20015#true} is VALID [2018-11-14 18:06:25,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {20015#true} assume !(~p3~0 != 0bv32); {20015#true} is VALID [2018-11-14 18:06:25,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {20015#true} assume !(~p4~0 != 0bv32); {20015#true} is VALID [2018-11-14 18:06:25,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {20015#true} assume !(~p5~0 != 0bv32); {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume !(~p13~0 != 0bv32); {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {20056#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:25,959 INFO L273 TraceCheckUtils]: 27: Hoare triple {20056#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {20016#false} is VALID [2018-11-14 18:06:25,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {20016#false} assume ~lk5~0 != 1bv32; {20016#false} is VALID [2018-11-14 18:06:25,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {20016#false} assume !false; {20016#false} is VALID [2018-11-14 18:06:25,960 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-14 18:06:25,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:25,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:25,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:25,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:25,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:25,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:25,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:25,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:25,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:25,990 INFO L87 Difference]: Start difference. First operand 761 states and 1303 transitions. Second operand 3 states. [2018-11-14 18:06:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:26,589 INFO L93 Difference]: Finished difference Result 2221 states and 3801 transitions. [2018-11-14 18:06:26,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:26,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2018-11-14 18:06:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2018-11-14 18:06:26,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2018-11-14 18:06:26,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:26,941 INFO L225 Difference]: With dead ends: 2221 [2018-11-14 18:06:26,941 INFO L226 Difference]: Without dead ends: 1483 [2018-11-14 18:06:26,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-14 18:06:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1481. [2018-11-14 18:06:27,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:27,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1483 states. Second operand 1481 states. [2018-11-14 18:06:27,448 INFO L74 IsIncluded]: Start isIncluded. First operand 1483 states. Second operand 1481 states. [2018-11-14 18:06:27,449 INFO L87 Difference]: Start difference. First operand 1483 states. Second operand 1481 states. [2018-11-14 18:06:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:27,522 INFO L93 Difference]: Finished difference Result 1483 states and 2504 transitions. [2018-11-14 18:06:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2504 transitions. [2018-11-14 18:06:27,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:27,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:27,523 INFO L74 IsIncluded]: Start isIncluded. First operand 1481 states. Second operand 1483 states. [2018-11-14 18:06:27,523 INFO L87 Difference]: Start difference. First operand 1481 states. Second operand 1483 states. [2018-11-14 18:06:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:27,603 INFO L93 Difference]: Finished difference Result 1483 states and 2504 transitions. [2018-11-14 18:06:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2504 transitions. [2018-11-14 18:06:27,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:27,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:27,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:27,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-14 18:06:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2503 transitions. [2018-11-14 18:06:27,672 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2503 transitions. Word has length 30 [2018-11-14 18:06:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:27,672 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2503 transitions. [2018-11-14 18:06:27,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2503 transitions. [2018-11-14 18:06:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:06:27,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:27,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:27,674 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -32619795, now seen corresponding path program 1 times [2018-11-14 18:06:27,674 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:27,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:27,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:27,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {26869#true} call ULTIMATE.init(); {26869#true} is VALID [2018-11-14 18:06:27,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {26869#true} assume true; {26869#true} is VALID [2018-11-14 18:06:27,927 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26869#true} {26869#true} #283#return; {26869#true} is VALID [2018-11-14 18:06:27,927 INFO L256 TraceCheckUtils]: 3: Hoare triple {26869#true} call #t~ret16 := main(); {26869#true} is VALID [2018-11-14 18:06:27,928 INFO L273 TraceCheckUtils]: 4: Hoare triple {26869#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {26869#true} is VALID [2018-11-14 18:06:27,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {26869#true} assume true; {26869#true} is VALID [2018-11-14 18:06:27,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {26869#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {26869#true} is VALID [2018-11-14 18:06:27,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {26869#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {26869#true} is VALID [2018-11-14 18:06:27,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {26869#true} assume !(~p1~0 != 0bv32); {26869#true} is VALID [2018-11-14 18:06:27,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {26869#true} assume !(~p2~0 != 0bv32); {26869#true} is VALID [2018-11-14 18:06:27,929 INFO L273 TraceCheckUtils]: 10: Hoare triple {26869#true} assume !(~p3~0 != 0bv32); {26869#true} is VALID [2018-11-14 18:06:27,929 INFO L273 TraceCheckUtils]: 11: Hoare triple {26869#true} assume !(~p4~0 != 0bv32); {26869#true} is VALID [2018-11-14 18:06:27,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {26869#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:27,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {26910#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {26870#false} is VALID [2018-11-14 18:06:27,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {26870#false} assume !false; {26870#false} is VALID [2018-11-14 18:06:27,948 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-14 18:06:27,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:27,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:27,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:27,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:27,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:27,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:27,980 INFO L87 Difference]: Start difference. First operand 1481 states and 2503 transitions. Second operand 3 states. [2018-11-14 18:06:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:28,685 INFO L93 Difference]: Finished difference Result 1853 states and 3193 transitions. [2018-11-14 18:06:28,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:28,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 18:06:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-14 18:06:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-14 18:06:28,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-14 18:06:28,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:28,995 INFO L225 Difference]: With dead ends: 1853 [2018-11-14 18:06:28,995 INFO L226 Difference]: Without dead ends: 1851 [2018-11-14 18:06:28,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-11-14 18:06:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1481. [2018-11-14 18:06:30,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:30,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1851 states. Second operand 1481 states. [2018-11-14 18:06:30,114 INFO L74 IsIncluded]: Start isIncluded. First operand 1851 states. Second operand 1481 states. [2018-11-14 18:06:30,114 INFO L87 Difference]: Start difference. First operand 1851 states. Second operand 1481 states. [2018-11-14 18:06:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:30,224 INFO L93 Difference]: Finished difference Result 1851 states and 3176 transitions. [2018-11-14 18:06:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3176 transitions. [2018-11-14 18:06:30,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:30,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:30,226 INFO L74 IsIncluded]: Start isIncluded. First operand 1481 states. Second operand 1851 states. [2018-11-14 18:06:30,226 INFO L87 Difference]: Start difference. First operand 1481 states. Second operand 1851 states. [2018-11-14 18:06:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:30,338 INFO L93 Difference]: Finished difference Result 1851 states and 3176 transitions. [2018-11-14 18:06:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3176 transitions. [2018-11-14 18:06:30,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:30,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:30,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:30,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-14 18:06:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2487 transitions. [2018-11-14 18:06:30,405 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2487 transitions. Word has length 30 [2018-11-14 18:06:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:30,406 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2487 transitions. [2018-11-14 18:06:30,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2487 transitions. [2018-11-14 18:06:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:06:30,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:30,407 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:30,407 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:30,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1595023034, now seen corresponding path program 1 times [2018-11-14 18:06:30,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:30,407 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:30,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:30,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:30,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {34091#true} call ULTIMATE.init(); {34091#true} is VALID [2018-11-14 18:06:30,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {34091#true} assume true; {34091#true} is VALID [2018-11-14 18:06:30,529 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {34091#true} {34091#true} #283#return; {34091#true} is VALID [2018-11-14 18:06:30,530 INFO L256 TraceCheckUtils]: 3: Hoare triple {34091#true} call #t~ret16 := main(); {34091#true} is VALID [2018-11-14 18:06:30,530 INFO L273 TraceCheckUtils]: 4: Hoare triple {34091#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {34091#true} is VALID [2018-11-14 18:06:30,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {34091#true} assume true; {34091#true} is VALID [2018-11-14 18:06:30,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {34091#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {34091#true} is VALID [2018-11-14 18:06:30,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {34091#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {34091#true} is VALID [2018-11-14 18:06:30,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {34091#true} assume !(~p1~0 != 0bv32); {34091#true} is VALID [2018-11-14 18:06:30,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {34091#true} assume !(~p2~0 != 0bv32); {34091#true} is VALID [2018-11-14 18:06:30,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {34091#true} assume !(~p3~0 != 0bv32); {34091#true} is VALID [2018-11-14 18:06:30,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {34091#true} assume !(~p4~0 != 0bv32); {34091#true} is VALID [2018-11-14 18:06:30,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {34091#true} assume !(~p5~0 != 0bv32); {34091#true} is VALID [2018-11-14 18:06:30,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {34091#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,540 INFO L273 TraceCheckUtils]: 25: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:30,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {34135#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {34092#false} is VALID [2018-11-14 18:06:30,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {34092#false} assume !false; {34092#false} is VALID [2018-11-14 18:06:30,543 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-14 18:06:30,543 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:30,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:30,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:30,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:30,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:30,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:30,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:30,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:30,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:30,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:30,580 INFO L87 Difference]: Start difference. First operand 1481 states and 2487 transitions. Second operand 3 states. [2018-11-14 18:06:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:31,715 INFO L93 Difference]: Finished difference Result 2749 states and 4697 transitions. [2018-11-14 18:06:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:31,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2018-11-14 18:06:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2018-11-14 18:06:31,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2018-11-14 18:06:31,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:32,194 INFO L225 Difference]: With dead ends: 2749 [2018-11-14 18:06:32,194 INFO L226 Difference]: Without dead ends: 2747 [2018-11-14 18:06:32,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-11-14 18:06:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2073. [2018-11-14 18:06:32,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:32,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2747 states. Second operand 2073 states. [2018-11-14 18:06:32,980 INFO L74 IsIncluded]: Start isIncluded. First operand 2747 states. Second operand 2073 states. [2018-11-14 18:06:32,981 INFO L87 Difference]: Start difference. First operand 2747 states. Second operand 2073 states. [2018-11-14 18:06:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:33,254 INFO L93 Difference]: Finished difference Result 2747 states and 4664 transitions. [2018-11-14 18:06:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4664 transitions. [2018-11-14 18:06:33,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:33,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:33,258 INFO L74 IsIncluded]: Start isIncluded. First operand 2073 states. Second operand 2747 states. [2018-11-14 18:06:33,258 INFO L87 Difference]: Start difference. First operand 2073 states. Second operand 2747 states. [2018-11-14 18:06:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:33,472 INFO L93 Difference]: Finished difference Result 2747 states and 4664 transitions. [2018-11-14 18:06:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4664 transitions. [2018-11-14 18:06:33,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:33,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:33,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:33,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-11-14 18:06:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3415 transitions. [2018-11-14 18:06:33,647 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3415 transitions. Word has length 31 [2018-11-14 18:06:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:33,647 INFO L480 AbstractCegarLoop]: Abstraction has 2073 states and 3415 transitions. [2018-11-14 18:06:33,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3415 transitions. [2018-11-14 18:06:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:06:33,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:33,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:33,649 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:33,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -399121672, now seen corresponding path program 1 times [2018-11-14 18:06:33,650 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:33,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:33,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:33,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {44612#true} call ULTIMATE.init(); {44612#true} is VALID [2018-11-14 18:06:33,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {44612#true} assume true; {44612#true} is VALID [2018-11-14 18:06:33,764 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {44612#true} {44612#true} #283#return; {44612#true} is VALID [2018-11-14 18:06:33,764 INFO L256 TraceCheckUtils]: 3: Hoare triple {44612#true} call #t~ret16 := main(); {44612#true} is VALID [2018-11-14 18:06:33,764 INFO L273 TraceCheckUtils]: 4: Hoare triple {44612#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {44612#true} assume true; {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {44612#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {44612#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {44612#true} assume !(~p1~0 != 0bv32); {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {44612#true} assume !(~p2~0 != 0bv32); {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {44612#true} assume !(~p3~0 != 0bv32); {44612#true} is VALID [2018-11-14 18:06:33,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {44612#true} assume !(~p4~0 != 0bv32); {44612#true} is VALID [2018-11-14 18:06:33,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {44612#true} assume !(~p5~0 != 0bv32); {44612#true} is VALID [2018-11-14 18:06:33,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {44612#true} assume !(~p6~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume !(~p13~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {44656#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:06:33,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {44656#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {44613#false} is VALID [2018-11-14 18:06:33,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {44613#false} assume ~lk6~0 != 1bv32; {44613#false} is VALID [2018-11-14 18:06:33,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {44613#false} assume !false; {44613#false} is VALID [2018-11-14 18:06:33,774 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-14 18:06:33,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:33,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:33,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:33,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:33,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:33,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:33,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:33,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:33,829 INFO L87 Difference]: Start difference. First operand 2073 states and 3415 transitions. Second operand 3 states. [2018-11-14 18:06:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:35,511 INFO L93 Difference]: Finished difference Result 4957 states and 8217 transitions. [2018-11-14 18:06:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:35,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 18:06:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2018-11-14 18:06:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2018-11-14 18:06:35,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 269 transitions. [2018-11-14 18:06:35,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:36,119 INFO L225 Difference]: With dead ends: 4957 [2018-11-14 18:06:36,119 INFO L226 Difference]: Without dead ends: 2907 [2018-11-14 18:06:36,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-14 18:06:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2905. [2018-11-14 18:06:36,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:36,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2907 states. Second operand 2905 states. [2018-11-14 18:06:36,846 INFO L74 IsIncluded]: Start isIncluded. First operand 2907 states. Second operand 2905 states. [2018-11-14 18:06:36,847 INFO L87 Difference]: Start difference. First operand 2907 states. Second operand 2905 states. [2018-11-14 18:06:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:37,101 INFO L93 Difference]: Finished difference Result 2907 states and 4776 transitions. [2018-11-14 18:06:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4776 transitions. [2018-11-14 18:06:37,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:37,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:37,104 INFO L74 IsIncluded]: Start isIncluded. First operand 2905 states. Second operand 2907 states. [2018-11-14 18:06:37,104 INFO L87 Difference]: Start difference. First operand 2905 states. Second operand 2907 states. [2018-11-14 18:06:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:37,328 INFO L93 Difference]: Finished difference Result 2907 states and 4776 transitions. [2018-11-14 18:06:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4776 transitions. [2018-11-14 18:06:37,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:37,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:37,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:37,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2018-11-14 18:06:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4775 transitions. [2018-11-14 18:06:37,585 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4775 transitions. Word has length 31 [2018-11-14 18:06:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:37,585 INFO L480 AbstractCegarLoop]: Abstraction has 2905 states and 4775 transitions. [2018-11-14 18:06:37,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4775 transitions. [2018-11-14 18:06:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:06:37,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:37,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:37,587 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:37,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2093680032, now seen corresponding path program 1 times [2018-11-14 18:06:37,588 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:37,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:37,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {58557#true} call ULTIMATE.init(); {58557#true} is VALID [2018-11-14 18:06:37,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {58557#true} assume true; {58557#true} is VALID [2018-11-14 18:06:37,758 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {58557#true} {58557#true} #283#return; {58557#true} is VALID [2018-11-14 18:06:37,758 INFO L256 TraceCheckUtils]: 3: Hoare triple {58557#true} call #t~ret16 := main(); {58557#true} is VALID [2018-11-14 18:06:37,759 INFO L273 TraceCheckUtils]: 4: Hoare triple {58557#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {58557#true} is VALID [2018-11-14 18:06:37,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {58557#true} assume true; {58557#true} is VALID [2018-11-14 18:06:37,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {58557#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {58557#true} is VALID [2018-11-14 18:06:37,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {58557#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {58557#true} is VALID [2018-11-14 18:06:37,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {58557#true} assume !(~p1~0 != 0bv32); {58557#true} is VALID [2018-11-14 18:06:37,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {58557#true} assume !(~p2~0 != 0bv32); {58557#true} is VALID [2018-11-14 18:06:37,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {58557#true} assume !(~p3~0 != 0bv32); {58557#true} is VALID [2018-11-14 18:06:37,760 INFO L273 TraceCheckUtils]: 11: Hoare triple {58557#true} assume !(~p4~0 != 0bv32); {58557#true} is VALID [2018-11-14 18:06:37,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {58557#true} assume !(~p5~0 != 0bv32); {58557#true} is VALID [2018-11-14 18:06:37,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {58557#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p13~0 != 0bv32); {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,784 INFO L273 TraceCheckUtils]: 22: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,784 INFO L273 TraceCheckUtils]: 23: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,786 INFO L273 TraceCheckUtils]: 25: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {58601#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:06:37,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {58601#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {58558#false} is VALID [2018-11-14 18:06:37,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {58558#false} assume ~p7~0 != 0bv32; {58558#false} is VALID [2018-11-14 18:06:37,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {58558#false} assume ~lk7~0 != 1bv32; {58558#false} is VALID [2018-11-14 18:06:37,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {58558#false} assume !false; {58558#false} is VALID [2018-11-14 18:06:37,791 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-14 18:06:37,791 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:37,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:37,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:37,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 18:06:37,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:37,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:37,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:37,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:37,845 INFO L87 Difference]: Start difference. First operand 2905 states and 4775 transitions. Second operand 3 states. [2018-11-14 18:06:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:39,469 INFO L93 Difference]: Finished difference Result 4381 states and 7193 transitions. [2018-11-14 18:06:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:39,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 18:06:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2018-11-14 18:06:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2018-11-14 18:06:39,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 264 transitions. [2018-11-14 18:06:39,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:40,054 INFO L225 Difference]: With dead ends: 4381 [2018-11-14 18:06:40,055 INFO L226 Difference]: Without dead ends: 2955 [2018-11-14 18:06:40,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2018-11-14 18:06:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2018-11-14 18:06:41,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:41,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand 2953 states. [2018-11-14 18:06:41,158 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand 2953 states. [2018-11-14 18:06:41,158 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand 2953 states. [2018-11-14 18:06:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:41,467 INFO L93 Difference]: Finished difference Result 2955 states and 4808 transitions. [2018-11-14 18:06:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4808 transitions. [2018-11-14 18:06:41,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:41,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:41,471 INFO L74 IsIncluded]: Start isIncluded. First operand 2953 states. Second operand 2955 states. [2018-11-14 18:06:41,471 INFO L87 Difference]: Start difference. First operand 2953 states. Second operand 2955 states. [2018-11-14 18:06:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:41,783 INFO L93 Difference]: Finished difference Result 2955 states and 4808 transitions. [2018-11-14 18:06:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4808 transitions. [2018-11-14 18:06:41,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:41,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:41,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:41,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-11-14 18:06:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4807 transitions. [2018-11-14 18:06:42,124 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4807 transitions. Word has length 32 [2018-11-14 18:06:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:42,124 INFO L480 AbstractCegarLoop]: Abstraction has 2953 states and 4807 transitions. [2018-11-14 18:06:42,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4807 transitions. [2018-11-14 18:06:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:06:42,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:42,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:42,126 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:42,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash 512343522, now seen corresponding path program 1 times [2018-11-14 18:06:42,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:42,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:42,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:42,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {72073#true} call ULTIMATE.init(); {72073#true} is VALID [2018-11-14 18:06:42,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {72073#true} assume true; {72073#true} is VALID [2018-11-14 18:06:42,232 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {72073#true} {72073#true} #283#return; {72073#true} is VALID [2018-11-14 18:06:42,232 INFO L256 TraceCheckUtils]: 3: Hoare triple {72073#true} call #t~ret16 := main(); {72073#true} is VALID [2018-11-14 18:06:42,232 INFO L273 TraceCheckUtils]: 4: Hoare triple {72073#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {72073#true} assume true; {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {72073#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {72073#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {72073#true} assume !(~p1~0 != 0bv32); {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {72073#true} assume !(~p2~0 != 0bv32); {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {72073#true} assume !(~p3~0 != 0bv32); {72073#true} is VALID [2018-11-14 18:06:42,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {72073#true} assume !(~p4~0 != 0bv32); {72073#true} is VALID [2018-11-14 18:06:42,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {72073#true} assume !(~p5~0 != 0bv32); {72073#true} is VALID [2018-11-14 18:06:42,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {72073#true} assume !(~p6~0 != 0bv32); {72073#true} is VALID [2018-11-14 18:06:42,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {72073#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,255 INFO L273 TraceCheckUtils]: 24: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,257 INFO L273 TraceCheckUtils]: 29: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:42,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {72120#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {72074#false} is VALID [2018-11-14 18:06:42,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {72074#false} assume !false; {72074#false} is VALID [2018-11-14 18:06:42,258 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-14 18:06:42,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:42,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:42,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:42,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 18:06:42,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:42,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:42,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:42,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:42,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:42,295 INFO L87 Difference]: Start difference. First operand 2953 states and 4807 transitions. Second operand 3 states. [2018-11-14 18:06:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:44,935 INFO L93 Difference]: Finished difference Result 5389 states and 8937 transitions. [2018-11-14 18:06:44,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:44,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 18:06:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-14 18:06:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-14 18:06:44,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2018-11-14 18:06:45,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:46,227 INFO L225 Difference]: With dead ends: 5389 [2018-11-14 18:06:46,228 INFO L226 Difference]: Without dead ends: 5387 [2018-11-14 18:06:46,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-14 18:06:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 4169. [2018-11-14 18:06:46,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:46,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5387 states. Second operand 4169 states. [2018-11-14 18:06:46,766 INFO L74 IsIncluded]: Start isIncluded. First operand 5387 states. Second operand 4169 states. [2018-11-14 18:06:46,766 INFO L87 Difference]: Start difference. First operand 5387 states. Second operand 4169 states. [2018-11-14 18:06:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:47,805 INFO L93 Difference]: Finished difference Result 5387 states and 8872 transitions. [2018-11-14 18:06:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 8872 transitions. [2018-11-14 18:06:47,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:47,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:47,810 INFO L74 IsIncluded]: Start isIncluded. First operand 4169 states. Second operand 5387 states. [2018-11-14 18:06:47,811 INFO L87 Difference]: Start difference. First operand 4169 states. Second operand 5387 states. [2018-11-14 18:06:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:48,874 INFO L93 Difference]: Finished difference Result 5387 states and 8872 transitions. [2018-11-14 18:06:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 8872 transitions. [2018-11-14 18:06:48,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:48,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:48,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:48,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2018-11-14 18:06:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 6631 transitions. [2018-11-14 18:06:49,595 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 6631 transitions. Word has length 32 [2018-11-14 18:06:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:49,595 INFO L480 AbstractCegarLoop]: Abstraction has 4169 states and 6631 transitions. [2018-11-14 18:06:49,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 6631 transitions. [2018-11-14 18:06:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:06:49,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:49,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:49,599 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:49,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1481801184, now seen corresponding path program 1 times [2018-11-14 18:06:49,599 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:49,599 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:49,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:49,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:49,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {92709#true} call ULTIMATE.init(); {92709#true} is VALID [2018-11-14 18:06:49,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {92709#true} assume true; {92709#true} is VALID [2018-11-14 18:06:49,704 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {92709#true} {92709#true} #283#return; {92709#true} is VALID [2018-11-14 18:06:49,704 INFO L256 TraceCheckUtils]: 3: Hoare triple {92709#true} call #t~ret16 := main(); {92709#true} is VALID [2018-11-14 18:06:49,704 INFO L273 TraceCheckUtils]: 4: Hoare triple {92709#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {92709#true} assume true; {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {92709#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {92709#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {92709#true} assume !(~p1~0 != 0bv32); {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {92709#true} assume !(~p2~0 != 0bv32); {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {92709#true} assume !(~p3~0 != 0bv32); {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {92709#true} assume !(~p4~0 != 0bv32); {92709#true} is VALID [2018-11-14 18:06:49,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {92709#true} assume !(~p5~0 != 0bv32); {92709#true} is VALID [2018-11-14 18:06:49,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {92709#true} assume !(~p6~0 != 0bv32); {92709#true} is VALID [2018-11-14 18:06:49,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {92709#true} assume !(~p7~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p13~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {92756#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:06:49,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {92756#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {92710#false} is VALID [2018-11-14 18:06:49,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {92710#false} assume ~lk7~0 != 1bv32; {92710#false} is VALID [2018-11-14 18:06:49,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {92710#false} assume !false; {92710#false} is VALID [2018-11-14 18:06:49,719 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-14 18:06:49,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:49,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:49,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:49,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 18:06:49,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:49,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:49,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:49,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:49,752 INFO L87 Difference]: Start difference. First operand 4169 states and 6631 transitions. Second operand 3 states. [2018-11-14 18:06:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:54,938 INFO L93 Difference]: Finished difference Result 9869 states and 15785 transitions. [2018-11-14 18:06:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:54,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 18:06:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2018-11-14 18:06:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2018-11-14 18:06:54,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 266 transitions. [2018-11-14 18:06:55,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:56,714 INFO L225 Difference]: With dead ends: 9869 [2018-11-14 18:06:56,714 INFO L226 Difference]: Without dead ends: 5771 [2018-11-14 18:06:56,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2018-11-14 18:06:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5769. [2018-11-14 18:06:58,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:58,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5771 states. Second operand 5769 states. [2018-11-14 18:06:58,633 INFO L74 IsIncluded]: Start isIncluded. First operand 5771 states. Second operand 5769 states. [2018-11-14 18:06:58,633 INFO L87 Difference]: Start difference. First operand 5771 states. Second operand 5769 states. [2018-11-14 18:06:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:59,844 INFO L93 Difference]: Finished difference Result 5771 states and 9160 transitions. [2018-11-14 18:06:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 9160 transitions. [2018-11-14 18:06:59,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:59,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:59,851 INFO L74 IsIncluded]: Start isIncluded. First operand 5769 states. Second operand 5771 states. [2018-11-14 18:06:59,851 INFO L87 Difference]: Start difference. First operand 5769 states. Second operand 5771 states. [2018-11-14 18:07:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:01,080 INFO L93 Difference]: Finished difference Result 5771 states and 9160 transitions. [2018-11-14 18:07:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 9160 transitions. [2018-11-14 18:07:01,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:01,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:01,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:07:01,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:07:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-14 18:07:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 9159 transitions. [2018-11-14 18:07:02,414 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 9159 transitions. Word has length 32 [2018-11-14 18:07:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:07:02,414 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 9159 transitions. [2018-11-14 18:07:02,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:07:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 9159 transitions. [2018-11-14 18:07:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:07:02,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:07:02,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:07:02,418 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:07:02,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:07:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1297006195, now seen corresponding path program 1 times [2018-11-14 18:07:02,418 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:07:02,419 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:07:02,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:07:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:07:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:07:02,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:07:02,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {120321#true} call ULTIMATE.init(); {120321#true} is VALID [2018-11-14 18:07:02,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {120321#true} assume true; {120321#true} is VALID [2018-11-14 18:07:02,534 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {120321#true} {120321#true} #283#return; {120321#true} is VALID [2018-11-14 18:07:02,534 INFO L256 TraceCheckUtils]: 3: Hoare triple {120321#true} call #t~ret16 := main(); {120321#true} is VALID [2018-11-14 18:07:02,535 INFO L273 TraceCheckUtils]: 4: Hoare triple {120321#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {120321#true} is VALID [2018-11-14 18:07:02,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {120321#true} assume true; {120321#true} is VALID [2018-11-14 18:07:02,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {120321#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {120321#true} is VALID [2018-11-14 18:07:02,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {120321#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {120321#true} is VALID [2018-11-14 18:07:02,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {120321#true} assume !(~p1~0 != 0bv32); {120321#true} is VALID [2018-11-14 18:07:02,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {120321#true} assume !(~p2~0 != 0bv32); {120321#true} is VALID [2018-11-14 18:07:02,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {120321#true} assume !(~p3~0 != 0bv32); {120321#true} is VALID [2018-11-14 18:07:02,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {120321#true} assume !(~p4~0 != 0bv32); {120321#true} is VALID [2018-11-14 18:07:02,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {120321#true} assume !(~p5~0 != 0bv32); {120321#true} is VALID [2018-11-14 18:07:02,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {120321#true} assume !(~p6~0 != 0bv32); {120321#true} is VALID [2018-11-14 18:07:02,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {120321#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p13~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,610 INFO L273 TraceCheckUtils]: 24: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {120368#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:07:02,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {120368#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {120322#false} is VALID [2018-11-14 18:07:02,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {120322#false} assume ~p8~0 != 0bv32; {120322#false} is VALID [2018-11-14 18:07:02,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {120322#false} assume ~lk8~0 != 1bv32; {120322#false} is VALID [2018-11-14 18:07:02,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {120322#false} assume !false; {120322#false} is VALID [2018-11-14 18:07:02,619 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-14 18:07:02,619 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:07:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:07:02,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:07:02,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-14 18:07:02,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:07:02,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:07:02,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:07:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:07:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:07:02,662 INFO L87 Difference]: Start difference. First operand 5769 states and 9159 transitions. Second operand 3 states. [2018-11-14 18:07:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:06,774 INFO L93 Difference]: Finished difference Result 8653 states and 13705 transitions. [2018-11-14 18:07:06,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:07:06,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-14 18:07:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:07:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2018-11-14 18:07:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2018-11-14 18:07:06,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2018-11-14 18:07:07,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:09,331 INFO L225 Difference]: With dead ends: 8653 [2018-11-14 18:07:09,331 INFO L226 Difference]: Without dead ends: 5835 [2018-11-14 18:07:09,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:07:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2018-11-14 18:07:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5833. [2018-11-14 18:07:10,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:07:10,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5835 states. Second operand 5833 states. [2018-11-14 18:07:10,553 INFO L74 IsIncluded]: Start isIncluded. First operand 5835 states. Second operand 5833 states. [2018-11-14 18:07:10,553 INFO L87 Difference]: Start difference. First operand 5835 states. Second operand 5833 states. [2018-11-14 18:07:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:11,786 INFO L93 Difference]: Finished difference Result 5835 states and 9160 transitions. [2018-11-14 18:07:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 9160 transitions. [2018-11-14 18:07:11,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:11,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:11,790 INFO L74 IsIncluded]: Start isIncluded. First operand 5833 states. Second operand 5835 states. [2018-11-14 18:07:11,790 INFO L87 Difference]: Start difference. First operand 5833 states. Second operand 5835 states. [2018-11-14 18:07:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:13,048 INFO L93 Difference]: Finished difference Result 5835 states and 9160 transitions. [2018-11-14 18:07:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 9160 transitions. [2018-11-14 18:07:13,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:13,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:13,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:07:13,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:07:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5833 states. [2018-11-14 18:07:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 9159 transitions. [2018-11-14 18:07:14,471 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 9159 transitions. Word has length 33 [2018-11-14 18:07:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:07:14,471 INFO L480 AbstractCegarLoop]: Abstraction has 5833 states and 9159 transitions. [2018-11-14 18:07:14,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:07:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 9159 transitions. [2018-11-14 18:07:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:07:14,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:07:14,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:07:14,474 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:07:14,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:07:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1309017359, now seen corresponding path program 1 times [2018-11-14 18:07:14,474 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:07:14,474 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:07:14,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:07:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:07:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:07:14,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:07:14,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {146912#true} call ULTIMATE.init(); {146912#true} is VALID [2018-11-14 18:07:14,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {146912#true} assume true; {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {146912#true} {146912#true} #283#return; {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L256 TraceCheckUtils]: 3: Hoare triple {146912#true} call #t~ret16 := main(); {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L273 TraceCheckUtils]: 4: Hoare triple {146912#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {146912#true} assume true; {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {146912#true} assume !false;~cond~0 := #t~nondet15;havoc #t~nondet15; {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {146912#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32;~lk15~0 := 0bv32; {146912#true} is VALID [2018-11-14 18:07:14,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {146912#true} assume !(~p1~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {146912#true} assume !(~p2~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {146912#true} assume !(~p3~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {146912#true} assume !(~p4~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {146912#true} assume !(~p5~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {146912#true} assume !(~p6~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {146912#true} assume !(~p7~0 != 0bv32); {146912#true} is VALID [2018-11-14 18:07:14,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {146912#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p14~0 != 0bv32;~lk14~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p15~0 != 0bv32;~lk15~0 := 1bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:07:14,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {146962#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {146913#false} is VALID [2018-11-14 18:07:14,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {146913#false} assume !false; {146913#false} is VALID [2018-11-14 18:07:14,593 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-14 18:07:14,593 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:07:14,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:07:14,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:07:14,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-14 18:07:14,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:07:14,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:07:14,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:14,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:07:14,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:07:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:07:14,629 INFO L87 Difference]: Start difference. First operand 5833 states and 9159 transitions. Second operand 3 states. [2018-11-14 18:07:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:22,144 INFO L93 Difference]: Finished difference Result 10509 states and 16841 transitions. [2018-11-14 18:07:22,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:07:22,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-14 18:07:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:07:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-14 18:07:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-14 18:07:22,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2018-11-14 18:07:22,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:07:26,759 INFO L225 Difference]: With dead ends: 10509 [2018-11-14 18:07:26,760 INFO L226 Difference]: Without dead ends: 10507 [2018-11-14 18:07:26,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:07:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-11-14 18:07:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 8329. [2018-11-14 18:07:28,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:07:28,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand 8329 states. [2018-11-14 18:07:28,200 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand 8329 states. [2018-11-14 18:07:28,200 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand 8329 states. [2018-11-14 18:07:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:32,300 INFO L93 Difference]: Finished difference Result 10507 states and 16712 transitions. [2018-11-14 18:07:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 16712 transitions. [2018-11-14 18:07:32,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:32,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:32,308 INFO L74 IsIncluded]: Start isIncluded. First operand 8329 states. Second operand 10507 states. [2018-11-14 18:07:32,308 INFO L87 Difference]: Start difference. First operand 8329 states. Second operand 10507 states. [2018-11-14 18:07:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:36,422 INFO L93 Difference]: Finished difference Result 10507 states and 16712 transitions. [2018-11-14 18:07:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 16712 transitions. [2018-11-14 18:07:36,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:07:36,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:07:36,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:07:36,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:07:36,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states.