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_10_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:05:23,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:05:23,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:05:23,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:05:23,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:05:23,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:05:23,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:05:23,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:05:23,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:05:23,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:05:23,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:05:23,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:05:23,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:05:23,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:05:23,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:05:23,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:05:23,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:05:23,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:05:23,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:05:23,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:05:23,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:05:23,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:05:23,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:05:23,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:05:23,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:05:23,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:05:23,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:05:23,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:05:23,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:05:23,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:05:23,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:05:23,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:05:23,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:05:23,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:05:23,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:05:23,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:05:23,591 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:05:23,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:05:23,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:05:23,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:05:23,621 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:05:23,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:05:23,622 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:05:23,622 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:05:23,622 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:05:23,622 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:05:23,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:05:23,623 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:05:23,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:05:23,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:05:23,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:05:23,626 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:05:23,626 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:05:23,627 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:05:23,627 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:05:23,627 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:05:23,627 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:05:23,627 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:05:23,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:05:23,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:05:23,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:05:23,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:05:23,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:05:23,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:05:23,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:05:23,630 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:05:23,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:05:23,630 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:05:23,630 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:05:23,631 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:05:23,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:05:23,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:05:23,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:05:23,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:05:23,698 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:05:23,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:23,755 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f06bf484/5af8d4a73a9a4b669d77369ef582ad29/FLAG154cabc1a [2018-11-14 18:05:24,143 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:05:24,144 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:24,153 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f06bf484/5af8d4a73a9a4b669d77369ef582ad29/FLAG154cabc1a [2018-11-14 18:05:24,168 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f06bf484/5af8d4a73a9a4b669d77369ef582ad29 [2018-11-14 18:05:24,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:05:24,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:05:24,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:05:24,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:05:24,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:05:24,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77017470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24, skipping insertion in model container [2018-11-14 18:05:24,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:05:24,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:05:24,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:05:24,450 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:05:24,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:05:24,499 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:05:24,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24 WrapperNode [2018-11-14 18:05:24,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:05:24,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:05:24,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:05:24,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:05:24,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (1/1) ... [2018-11-14 18:05:24,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:05:24,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:05:24,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:05:24,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:05:24,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (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:05:24,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:05:24,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:05:24,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:05:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:05:24,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:05:24,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:05:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:05:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:05:25,683 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:05:25,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:05:25 BoogieIcfgContainer [2018-11-14 18:05:25,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:05:25,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:05:25,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:05:25,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:05:25,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:05:24" (1/3) ... [2018-11-14 18:05:25,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650d56c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:05:25, skipping insertion in model container [2018-11-14 18:05:25,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:05:24" (2/3) ... [2018-11-14 18:05:25,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650d56c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:05:25, skipping insertion in model container [2018-11-14 18:05:25,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:05:25" (3/3) ... [2018-11-14 18:05:25,694 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:05:25,705 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:05:25,714 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:05:25,734 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:05:25,769 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:05:25,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:05:25,770 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:05:25,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:05:25,770 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:05:25,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:05:25,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:05:25,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:05:25,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:05:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 18:05:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:05:25,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:25,809 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] [2018-11-14 18:05:25,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:25,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-11-14 18:05:25,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:25,830 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:05:25,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:25,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:26,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 18:05:26,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 18:05:26,325 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #198#return; {48#true} is VALID [2018-11-14 18:05:26,326 INFO L256 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret11 := main(); {48#true} is VALID [2018-11-14 18:05:26,326 INFO L273 TraceCheckUtils]: 4: Hoare triple {48#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;havoc ~cond~0; {48#true} is VALID [2018-11-14 18:05:26,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 18:05:26,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {48#true} is VALID [2018-11-14 18:05:26,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {48#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; {48#true} is VALID [2018-11-14 18:05:26,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:26,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {49#false} is VALID [2018-11-14 18:05:26,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 18:05:26,454 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:05:26,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:26,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:26,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 18:05:26,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:26,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:26,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:26,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:26,620 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-14 18:05:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:27,524 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-11-14 18:05:27,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:27,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 18:05:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 18:05:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 18:05:27,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-14 18:05:28,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:28,063 INFO L225 Difference]: With dead ends: 89 [2018-11-14 18:05:28,063 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:05:28,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:05:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:05:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-11-14 18:05:28,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:28,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 51 states. [2018-11-14 18:05:28,114 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 51 states. [2018-11-14 18:05:28,114 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 51 states. [2018-11-14 18:05:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:28,124 INFO L93 Difference]: Finished difference Result 74 states and 130 transitions. [2018-11-14 18:05:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 130 transitions. [2018-11-14 18:05:28,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:28,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:28,126 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 74 states. [2018-11-14 18:05:28,127 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 74 states. [2018-11-14 18:05:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:28,135 INFO L93 Difference]: Finished difference Result 74 states and 130 transitions. [2018-11-14 18:05:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 130 transitions. [2018-11-14 18:05:28,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:28,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:28,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:28,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 18:05:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-11-14 18:05:28,143 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-11-14 18:05:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:28,144 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-11-14 18:05:28,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-11-14 18:05:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:05:28,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:28,146 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] [2018-11-14 18:05:28,146 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:28,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-11-14 18:05:28,147 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:28,147 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:05:28,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:28,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:28,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-14 18:05:28,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-14 18:05:28,273 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {419#true} {419#true} #198#return; {419#true} is VALID [2018-11-14 18:05:28,273 INFO L256 TraceCheckUtils]: 3: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2018-11-14 18:05:28,273 INFO L273 TraceCheckUtils]: 4: Hoare triple {419#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;havoc ~cond~0; {419#true} is VALID [2018-11-14 18:05:28,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-14 18:05:28,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {419#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {419#true} is VALID [2018-11-14 18:05:28,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#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; {419#true} is VALID [2018-11-14 18:05:28,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#true} assume !(~p1~0 != 0bv32); {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:05:28,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {420#false} is VALID [2018-11-14 18:05:28,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume ~lk1~0 != 1bv32; {420#false} is VALID [2018-11-14 18:05:28,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-14 18:05:28,332 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:05:28,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:28,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:28,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:28,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 18:05:28,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:28,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:28,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:28,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:28,419 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-11-14 18:05:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:28,911 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-11-14 18:05:28,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:28,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 18:05:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-14 18:05:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-14 18:05:28,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2018-11-14 18:05:29,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:29,259 INFO L225 Difference]: With dead ends: 120 [2018-11-14 18:05:29,260 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:05:29,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:05:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:05:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-14 18:05:29,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:29,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-14 18:05:29,288 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-14 18:05:29,288 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-14 18:05:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:29,293 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2018-11-14 18:05:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-11-14 18:05:29,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:29,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:29,295 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-14 18:05:29,295 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-14 18:05:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:29,300 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2018-11-14 18:05:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-11-14 18:05:29,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:29,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:29,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:29,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 18:05:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-11-14 18:05:29,306 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-11-14 18:05:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:29,306 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-11-14 18:05:29,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-11-14 18:05:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:05:29,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:29,308 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] [2018-11-14 18:05:29,308 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:29,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-11-14 18:05:29,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:29,309 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:05:29,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:29,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:29,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {841#true} is VALID [2018-11-14 18:05:29,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {841#true} assume true; {841#true} is VALID [2018-11-14 18:05:29,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {841#true} {841#true} #198#return; {841#true} is VALID [2018-11-14 18:05:29,428 INFO L256 TraceCheckUtils]: 3: Hoare triple {841#true} call #t~ret11 := main(); {841#true} is VALID [2018-11-14 18:05:29,428 INFO L273 TraceCheckUtils]: 4: Hoare triple {841#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;havoc ~cond~0; {841#true} is VALID [2018-11-14 18:05:29,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {841#true} assume true; {841#true} is VALID [2018-11-14 18:05:29,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {841#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {841#true} is VALID [2018-11-14 18:05:29,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {841#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; {841#true} is VALID [2018-11-14 18:05:29,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {841#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:05:29,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {842#false} is VALID [2018-11-14 18:05:29,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {842#false} assume ~p2~0 != 0bv32; {842#false} is VALID [2018-11-14 18:05:29,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {842#false} assume ~lk2~0 != 1bv32; {842#false} is VALID [2018-11-14 18:05:29,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {842#false} assume !false; {842#false} is VALID [2018-11-14 18:05:29,445 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:05:29,445 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:29,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:29,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:29,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:05:29,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:29,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:29,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:29,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:29,507 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-11-14 18:05:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:29,812 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-11-14 18:05:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:29,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:05:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-14 18:05:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-14 18:05:29,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-14 18:05:30,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:30,135 INFO L225 Difference]: With dead ends: 112 [2018-11-14 18:05:30,135 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:05:30,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:05:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:05:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-14 18:05:30,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:30,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-14 18:05:30,193 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-14 18:05:30,193 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-14 18:05:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:30,197 INFO L93 Difference]: Finished difference Result 78 states and 131 transitions. [2018-11-14 18:05:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 131 transitions. [2018-11-14 18:05:30,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:30,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:30,198 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-14 18:05:30,199 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-14 18:05:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:30,203 INFO L93 Difference]: Finished difference Result 78 states and 131 transitions. [2018-11-14 18:05:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 131 transitions. [2018-11-14 18:05:30,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:30,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:30,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:30,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 18:05:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-11-14 18:05:30,209 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-11-14 18:05:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:30,209 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-11-14 18:05:30,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-11-14 18:05:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:05:30,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:30,211 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] [2018-11-14 18:05:30,211 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:30,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-11-14 18:05:30,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:30,212 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:05:30,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:30,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:30,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {1272#true} call ULTIMATE.init(); {1272#true} is VALID [2018-11-14 18:05:30,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {1272#true} assume true; {1272#true} is VALID [2018-11-14 18:05:30,327 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1272#true} {1272#true} #198#return; {1272#true} is VALID [2018-11-14 18:05:30,327 INFO L256 TraceCheckUtils]: 3: Hoare triple {1272#true} call #t~ret11 := main(); {1272#true} is VALID [2018-11-14 18:05:30,327 INFO L273 TraceCheckUtils]: 4: Hoare triple {1272#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;havoc ~cond~0; {1272#true} is VALID [2018-11-14 18:05:30,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {1272#true} assume true; {1272#true} is VALID [2018-11-14 18:05:30,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {1272#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {1272#true} is VALID [2018-11-14 18:05:30,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {1272#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; {1272#true} is VALID [2018-11-14 18:05:30,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {1272#true} assume !(~p1~0 != 0bv32); {1272#true} is VALID [2018-11-14 18:05:30,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {1272#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:30,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1273#false} is VALID [2018-11-14 18:05:30,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {1273#false} assume !false; {1273#false} is VALID [2018-11-14 18:05:30,342 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:05:30,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:30,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:05:30,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:30,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:30,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:30,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:30,371 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-11-14 18:05:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:30,586 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-11-14 18:05:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:30,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:05:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 18:05:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 18:05:30,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-14 18:05:30,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:30,759 INFO L225 Difference]: With dead ends: 141 [2018-11-14 18:05:30,759 INFO L226 Difference]: Without dead ends: 139 [2018-11-14 18:05:30,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:05:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-14 18:05:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-11-14 18:05:30,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:30,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 99 states. [2018-11-14 18:05:30,795 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 99 states. [2018-11-14 18:05:30,795 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 99 states. [2018-11-14 18:05:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:30,802 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2018-11-14 18:05:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2018-11-14 18:05:30,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:30,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:30,803 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 139 states. [2018-11-14 18:05:30,803 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 139 states. [2018-11-14 18:05:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:30,810 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2018-11-14 18:05:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2018-11-14 18:05:30,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:30,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:30,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:30,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 18:05:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-11-14 18:05:30,816 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-11-14 18:05:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:30,817 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-11-14 18:05:30,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-11-14 18:05:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:05:30,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:30,818 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] [2018-11-14 18:05:30,818 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:30,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:30,819 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-11-14 18:05:30,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:30,819 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:05:30,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:30,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:30,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {1878#true} call ULTIMATE.init(); {1878#true} is VALID [2018-11-14 18:05:30,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {1878#true} assume true; {1878#true} is VALID [2018-11-14 18:05:30,928 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1878#true} {1878#true} #198#return; {1878#true} is VALID [2018-11-14 18:05:30,928 INFO L256 TraceCheckUtils]: 3: Hoare triple {1878#true} call #t~ret11 := main(); {1878#true} is VALID [2018-11-14 18:05:30,928 INFO L273 TraceCheckUtils]: 4: Hoare triple {1878#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;havoc ~cond~0; {1878#true} is VALID [2018-11-14 18:05:30,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {1878#true} assume true; {1878#true} is VALID [2018-11-14 18:05:30,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {1878#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {1878#true} is VALID [2018-11-14 18:05:30,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#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; {1878#true} is VALID [2018-11-14 18:05:30,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {1878#true} assume !(~p1~0 != 0bv32); {1878#true} is VALID [2018-11-14 18:05:30,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {1878#true} assume !(~p2~0 != 0bv32); {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:05:30,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {1879#false} is VALID [2018-11-14 18:05:30,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {1879#false} assume ~lk2~0 != 1bv32; {1879#false} is VALID [2018-11-14 18:05:30,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {1879#false} assume !false; {1879#false} is VALID [2018-11-14 18:05:30,942 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:05:30,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:30,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:30,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:30,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:05:30,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:30,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:30,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:30,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:30,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:30,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:30,982 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-11-14 18:05:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:31,235 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-11-14 18:05:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:31,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 18:05:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-14 18:05:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-14 18:05:31,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-14 18:05:31,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:31,672 INFO L225 Difference]: With dead ends: 231 [2018-11-14 18:05:31,672 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 18:05:31,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:05:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 18:05:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-14 18:05:31,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:31,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-14 18:05:31,722 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-14 18:05:31,723 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-14 18:05:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:31,728 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2018-11-14 18:05:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2018-11-14 18:05:31,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:31,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:31,729 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-14 18:05:31,729 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-14 18:05:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:31,734 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2018-11-14 18:05:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2018-11-14 18:05:31,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:31,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:31,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:31,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 18:05:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-11-14 18:05:31,740 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-11-14 18:05:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:31,741 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-11-14 18:05:31,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-11-14 18:05:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:05:31,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:31,742 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] [2018-11-14 18:05:31,742 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:31,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-11-14 18:05:31,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:31,743 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:05:31,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:31,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:31,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {2622#true} call ULTIMATE.init(); {2622#true} is VALID [2018-11-14 18:05:31,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {2622#true} assume true; {2622#true} is VALID [2018-11-14 18:05:31,857 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2622#true} {2622#true} #198#return; {2622#true} is VALID [2018-11-14 18:05:31,857 INFO L256 TraceCheckUtils]: 3: Hoare triple {2622#true} call #t~ret11 := main(); {2622#true} is VALID [2018-11-14 18:05:31,857 INFO L273 TraceCheckUtils]: 4: Hoare triple {2622#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;havoc ~cond~0; {2622#true} is VALID [2018-11-14 18:05:31,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {2622#true} assume true; {2622#true} is VALID [2018-11-14 18:05:31,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {2622#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {2622#true} is VALID [2018-11-14 18:05:31,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {2622#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; {2622#true} is VALID [2018-11-14 18:05:31,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {2622#true} assume !(~p1~0 != 0bv32); {2622#true} is VALID [2018-11-14 18:05:31,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {2622#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:05:31,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {2623#false} is VALID [2018-11-14 18:05:31,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {2623#false} assume ~p3~0 != 0bv32; {2623#false} is VALID [2018-11-14 18:05:31,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {2623#false} assume ~lk3~0 != 1bv32; {2623#false} is VALID [2018-11-14 18:05:31,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {2623#false} assume !false; {2623#false} is VALID [2018-11-14 18:05:31,906 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:05:31,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:31,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:31,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:31,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:31,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:31,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:31,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:31,960 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-11-14 18:05:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:32,180 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-11-14 18:05:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:32,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-14 18:05:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-14 18:05:32,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-14 18:05:32,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:32,558 INFO L225 Difference]: With dead ends: 208 [2018-11-14 18:05:32,558 INFO L226 Difference]: Without dead ends: 143 [2018-11-14 18:05:32,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:05:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-14 18:05:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-14 18:05:32,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:32,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-14 18:05:32,597 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-14 18:05:32,597 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-14 18:05:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:32,602 INFO L93 Difference]: Finished difference Result 143 states and 240 transitions. [2018-11-14 18:05:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 240 transitions. [2018-11-14 18:05:32,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:32,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:32,603 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-14 18:05:32,603 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-14 18:05:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:32,609 INFO L93 Difference]: Finished difference Result 143 states and 240 transitions. [2018-11-14 18:05:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 240 transitions. [2018-11-14 18:05:32,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:32,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:32,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:32,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-14 18:05:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-11-14 18:05:32,616 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-11-14 18:05:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:32,616 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-11-14 18:05:32,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-11-14 18:05:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:05:32,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:32,617 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] [2018-11-14 18:05:32,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:32,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-11-14 18:05:32,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:32,618 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:05:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:32,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:33,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {3352#true} call ULTIMATE.init(); {3352#true} is VALID [2018-11-14 18:05:33,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-14 18:05:33,244 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3352#true} {3352#true} #198#return; {3352#true} is VALID [2018-11-14 18:05:33,244 INFO L256 TraceCheckUtils]: 3: Hoare triple {3352#true} call #t~ret11 := main(); {3352#true} is VALID [2018-11-14 18:05:33,244 INFO L273 TraceCheckUtils]: 4: Hoare triple {3352#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;havoc ~cond~0; {3352#true} is VALID [2018-11-14 18:05:33,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-14 18:05:33,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {3352#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {3352#true} is VALID [2018-11-14 18:05:33,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {3352#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; {3352#true} is VALID [2018-11-14 18:05:33,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {3352#true} assume !(~p1~0 != 0bv32); {3352#true} is VALID [2018-11-14 18:05:33,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {3352#true} assume !(~p2~0 != 0bv32); {3352#true} is VALID [2018-11-14 18:05:33,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {3352#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:33,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {3353#false} is VALID [2018-11-14 18:05:33,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {3353#false} assume !false; {3353#false} is VALID [2018-11-14 18:05:33,257 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:05:33,257 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:33,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:33,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:33,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:33,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:33,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:33,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:33,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:33,291 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-11-14 18:05:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:33,510 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-11-14 18:05:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:33,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-14 18:05:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-14 18:05:33,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2018-11-14 18:05:34,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:34,037 INFO L225 Difference]: With dead ends: 261 [2018-11-14 18:05:34,037 INFO L226 Difference]: Without dead ends: 259 [2018-11-14 18:05:34,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:05:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-14 18:05:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-11-14 18:05:34,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:34,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand 189 states. [2018-11-14 18:05:34,373 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 189 states. [2018-11-14 18:05:34,373 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 189 states. [2018-11-14 18:05:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:34,384 INFO L93 Difference]: Finished difference Result 259 states and 444 transitions. [2018-11-14 18:05:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 444 transitions. [2018-11-14 18:05:34,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:34,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:34,386 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 259 states. [2018-11-14 18:05:34,386 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 259 states. [2018-11-14 18:05:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:34,398 INFO L93 Difference]: Finished difference Result 259 states and 444 transitions. [2018-11-14 18:05:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 444 transitions. [2018-11-14 18:05:34,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:34,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:34,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:34,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-14 18:05:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-11-14 18:05:34,407 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-11-14 18:05:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:34,407 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-11-14 18:05:34,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-11-14 18:05:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:05:34,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:34,408 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] [2018-11-14 18:05:34,409 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:34,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-11-14 18:05:34,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:34,410 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:05:34,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:34,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:34,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2018-11-14 18:05:34,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {4417#true} assume true; {4417#true} is VALID [2018-11-14 18:05:34,769 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4417#true} {4417#true} #198#return; {4417#true} is VALID [2018-11-14 18:05:34,770 INFO L256 TraceCheckUtils]: 3: Hoare triple {4417#true} call #t~ret11 := main(); {4417#true} is VALID [2018-11-14 18:05:34,770 INFO L273 TraceCheckUtils]: 4: Hoare triple {4417#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;havoc ~cond~0; {4417#true} is VALID [2018-11-14 18:05:34,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {4417#true} assume true; {4417#true} is VALID [2018-11-14 18:05:34,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {4417#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {4417#true} is VALID [2018-11-14 18:05:34,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {4417#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; {4417#true} is VALID [2018-11-14 18:05:34,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {4417#true} assume !(~p1~0 != 0bv32); {4417#true} is VALID [2018-11-14 18:05:34,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {4417#true} assume !(~p2~0 != 0bv32); {4417#true} is VALID [2018-11-14 18:05:34,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {4417#true} assume !(~p3~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,778 INFO L273 TraceCheckUtils]: 16: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:05:34,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {4418#false} is VALID [2018-11-14 18:05:34,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {4418#false} assume ~lk3~0 != 1bv32; {4418#false} is VALID [2018-11-14 18:05:34,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2018-11-14 18:05:34,781 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:05:34,781 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:34,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:34,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:34,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:34,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:34,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:34,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:34,806 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-11-14 18:05:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:35,210 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-11-14 18:05:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:35,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 18:05:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 18:05:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 18:05:35,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-14 18:05:35,621 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:05:35,628 INFO L225 Difference]: With dead ends: 445 [2018-11-14 18:05:35,628 INFO L226 Difference]: Without dead ends: 267 [2018-11-14 18:05:35,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:05:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-14 18:05:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-11-14 18:05:35,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:35,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 265 states. [2018-11-14 18:05:35,699 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 265 states. [2018-11-14 18:05:35,699 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 265 states. [2018-11-14 18:05:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:35,708 INFO L93 Difference]: Finished difference Result 267 states and 444 transitions. [2018-11-14 18:05:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2018-11-14 18:05:35,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:35,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:35,709 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 267 states. [2018-11-14 18:05:35,709 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 267 states. [2018-11-14 18:05:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:35,717 INFO L93 Difference]: Finished difference Result 267 states and 444 transitions. [2018-11-14 18:05:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2018-11-14 18:05:35,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:35,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:35,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:35,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-14 18:05:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-11-14 18:05:35,726 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-11-14 18:05:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:35,726 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-11-14 18:05:35,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-11-14 18:05:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:35,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:35,727 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] [2018-11-14 18:05:35,728 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:35,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-11-14 18:05:35,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:35,728 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:05:35,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:35,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:36,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {5766#true} call ULTIMATE.init(); {5766#true} is VALID [2018-11-14 18:05:36,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {5766#true} assume true; {5766#true} is VALID [2018-11-14 18:05:36,305 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5766#true} {5766#true} #198#return; {5766#true} is VALID [2018-11-14 18:05:36,305 INFO L256 TraceCheckUtils]: 3: Hoare triple {5766#true} call #t~ret11 := main(); {5766#true} is VALID [2018-11-14 18:05:36,306 INFO L273 TraceCheckUtils]: 4: Hoare triple {5766#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;havoc ~cond~0; {5766#true} is VALID [2018-11-14 18:05:36,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {5766#true} assume true; {5766#true} is VALID [2018-11-14 18:05:36,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {5766#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {5766#true} is VALID [2018-11-14 18:05:36,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {5766#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; {5766#true} is VALID [2018-11-14 18:05:36,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {5766#true} assume !(~p1~0 != 0bv32); {5766#true} is VALID [2018-11-14 18:05:36,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#true} assume !(~p2~0 != 0bv32); {5766#true} is VALID [2018-11-14 18:05:36,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:05:36,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {5767#false} is VALID [2018-11-14 18:05:36,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {5767#false} assume ~p4~0 != 0bv32; {5767#false} is VALID [2018-11-14 18:05:36,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {5767#false} assume ~lk4~0 != 1bv32; {5767#false} is VALID [2018-11-14 18:05:36,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {5767#false} assume !false; {5767#false} is VALID [2018-11-14 18:05:36,322 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:05:36,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:36,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:36,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:36,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:36,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:36,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:36,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:36,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:36,359 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-11-14 18:05:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:36,744 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-11-14 18:05:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:36,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 18:05:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 18:05:36,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2018-11-14 18:05:37,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:37,309 INFO L225 Difference]: With dead ends: 397 [2018-11-14 18:05:37,309 INFO L226 Difference]: Without dead ends: 271 [2018-11-14 18:05:37,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:05:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-14 18:05:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-11-14 18:05:37,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:37,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 269 states. [2018-11-14 18:05:37,437 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 269 states. [2018-11-14 18:05:37,437 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 269 states. [2018-11-14 18:05:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:37,445 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2018-11-14 18:05:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 444 transitions. [2018-11-14 18:05:37,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:37,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:37,446 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 271 states. [2018-11-14 18:05:37,446 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 271 states. [2018-11-14 18:05:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:37,454 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2018-11-14 18:05:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 444 transitions. [2018-11-14 18:05:37,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:37,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:37,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:37,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-14 18:05:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-11-14 18:05:37,462 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-11-14 18:05:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:37,462 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-11-14 18:05:37,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-11-14 18:05:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:37,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:37,463 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] [2018-11-14 18:05:37,463 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:37,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-11-14 18:05:37,464 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:37,464 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:05:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:37,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:37,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {7082#true} call ULTIMATE.init(); {7082#true} is VALID [2018-11-14 18:05:37,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {7082#true} assume true; {7082#true} is VALID [2018-11-14 18:05:37,966 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7082#true} {7082#true} #198#return; {7082#true} is VALID [2018-11-14 18:05:37,966 INFO L256 TraceCheckUtils]: 3: Hoare triple {7082#true} call #t~ret11 := main(); {7082#true} is VALID [2018-11-14 18:05:37,966 INFO L273 TraceCheckUtils]: 4: Hoare triple {7082#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;havoc ~cond~0; {7082#true} is VALID [2018-11-14 18:05:37,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {7082#true} assume true; {7082#true} is VALID [2018-11-14 18:05:37,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {7082#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {7082#true} is VALID [2018-11-14 18:05:37,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {7082#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; {7082#true} is VALID [2018-11-14 18:05:37,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {7082#true} assume !(~p1~0 != 0bv32); {7082#true} is VALID [2018-11-14 18:05:37,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {7082#true} assume !(~p2~0 != 0bv32); {7082#true} is VALID [2018-11-14 18:05:37,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {7082#true} assume !(~p3~0 != 0bv32); {7082#true} is VALID [2018-11-14 18:05:37,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {7082#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:37,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {7083#false} is VALID [2018-11-14 18:05:37,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {7083#false} assume !false; {7083#false} is VALID [2018-11-14 18:05:37,984 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:05:37,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:37,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:37,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:37,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:37,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:37,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:38,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:38,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:38,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:38,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:38,013 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-11-14 18:05:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:38,420 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-11-14 18:05:38,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:38,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-14 18:05:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-14 18:05:38,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2018-11-14 18:05:38,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:38,905 INFO L225 Difference]: With dead ends: 493 [2018-11-14 18:05:38,906 INFO L226 Difference]: Without dead ends: 491 [2018-11-14 18:05:38,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:05:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-14 18:05:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-11-14 18:05:39,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:39,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand 369 states. [2018-11-14 18:05:39,098 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 369 states. [2018-11-14 18:05:39,098 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 369 states. [2018-11-14 18:05:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:39,118 INFO L93 Difference]: Finished difference Result 491 states and 816 transitions. [2018-11-14 18:05:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 816 transitions. [2018-11-14 18:05:39,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:39,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:39,120 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand 491 states. [2018-11-14 18:05:39,120 INFO L87 Difference]: Start difference. First operand 369 states. Second operand 491 states. [2018-11-14 18:05:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:39,138 INFO L93 Difference]: Finished difference Result 491 states and 816 transitions. [2018-11-14 18:05:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 816 transitions. [2018-11-14 18:05:39,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:39,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:39,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:39,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-14 18:05:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-11-14 18:05:39,150 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-11-14 18:05:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:39,150 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-11-14 18:05:39,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-11-14 18:05:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:05:39,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:39,151 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] [2018-11-14 18:05:39,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:39,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-11-14 18:05:39,152 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:39,152 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:05:39,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:39,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:39,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {9038#true} call ULTIMATE.init(); {9038#true} is VALID [2018-11-14 18:05:39,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {9038#true} assume true; {9038#true} is VALID [2018-11-14 18:05:39,671 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9038#true} {9038#true} #198#return; {9038#true} is VALID [2018-11-14 18:05:39,671 INFO L256 TraceCheckUtils]: 3: Hoare triple {9038#true} call #t~ret11 := main(); {9038#true} is VALID [2018-11-14 18:05:39,672 INFO L273 TraceCheckUtils]: 4: Hoare triple {9038#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;havoc ~cond~0; {9038#true} is VALID [2018-11-14 18:05:39,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {9038#true} assume true; {9038#true} is VALID [2018-11-14 18:05:39,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {9038#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {9038#true} is VALID [2018-11-14 18:05:39,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {9038#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; {9038#true} is VALID [2018-11-14 18:05:39,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {9038#true} assume !(~p1~0 != 0bv32); {9038#true} is VALID [2018-11-14 18:05:39,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {9038#true} assume !(~p2~0 != 0bv32); {9038#true} is VALID [2018-11-14 18:05:39,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {9038#true} assume !(~p3~0 != 0bv32); {9038#true} is VALID [2018-11-14 18:05:39,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {9038#true} assume !(~p4~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:05:39,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {9039#false} is VALID [2018-11-14 18:05:39,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {9039#false} assume ~lk4~0 != 1bv32; {9039#false} is VALID [2018-11-14 18:05:39,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {9039#false} assume !false; {9039#false} is VALID [2018-11-14 18:05:39,683 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:05:39,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:39,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:39,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:39,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:39,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:39,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:39,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:39,709 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-11-14 18:05:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:40,380 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-11-14 18:05:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:40,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 18:05:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-14 18:05:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-14 18:05:40,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2018-11-14 18:05:41,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:41,217 INFO L225 Difference]: With dead ends: 869 [2018-11-14 18:05:41,217 INFO L226 Difference]: Without dead ends: 515 [2018-11-14 18:05:41,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:05:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-14 18:05:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-11-14 18:05:41,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:41,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand 513 states. [2018-11-14 18:05:41,376 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand 513 states. [2018-11-14 18:05:41,376 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 513 states. [2018-11-14 18:05:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:41,393 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions. [2018-11-14 18:05:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 824 transitions. [2018-11-14 18:05:41,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:41,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:41,395 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand 515 states. [2018-11-14 18:05:41,395 INFO L87 Difference]: Start difference. First operand 513 states. Second operand 515 states. [2018-11-14 18:05:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:41,410 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions. [2018-11-14 18:05:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 824 transitions. [2018-11-14 18:05:41,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:41,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:41,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:41,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-14 18:05:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-11-14 18:05:41,428 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-11-14 18:05:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:41,428 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-11-14 18:05:41,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-11-14 18:05:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:41,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:41,429 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] [2018-11-14 18:05:41,430 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:41,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-11-14 18:05:41,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:41,430 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:05:41,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:41,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:41,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {11578#true} call ULTIMATE.init(); {11578#true} is VALID [2018-11-14 18:05:41,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {11578#true} assume true; {11578#true} is VALID [2018-11-14 18:05:41,559 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11578#true} {11578#true} #198#return; {11578#true} is VALID [2018-11-14 18:05:41,560 INFO L256 TraceCheckUtils]: 3: Hoare triple {11578#true} call #t~ret11 := main(); {11578#true} is VALID [2018-11-14 18:05:41,560 INFO L273 TraceCheckUtils]: 4: Hoare triple {11578#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;havoc ~cond~0; {11578#true} is VALID [2018-11-14 18:05:41,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {11578#true} assume true; {11578#true} is VALID [2018-11-14 18:05:41,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {11578#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {11578#true} is VALID [2018-11-14 18:05:41,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {11578#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; {11578#true} is VALID [2018-11-14 18:05:41,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {11578#true} assume !(~p1~0 != 0bv32); {11578#true} is VALID [2018-11-14 18:05:41,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {11578#true} assume !(~p2~0 != 0bv32); {11578#true} is VALID [2018-11-14 18:05:41,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {11578#true} assume !(~p3~0 != 0bv32); {11578#true} is VALID [2018-11-14 18:05:41,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {11578#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:05:41,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {11579#false} is VALID [2018-11-14 18:05:41,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {11579#false} assume ~p5~0 != 0bv32; {11579#false} is VALID [2018-11-14 18:05:41,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {11579#false} assume ~lk5~0 != 1bv32; {11579#false} is VALID [2018-11-14 18:05:41,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {11579#false} assume !false; {11579#false} is VALID [2018-11-14 18:05:41,574 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:05:41,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:41,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:41,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:41,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:41,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:41,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:41,644 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-11-14 18:05:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:42,053 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-11-14 18:05:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:42,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-14 18:05:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-14 18:05:42,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2018-11-14 18:05:42,222 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:05:42,237 INFO L225 Difference]: With dead ends: 769 [2018-11-14 18:05:42,238 INFO L226 Difference]: Without dead ends: 523 [2018-11-14 18:05:42,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:05:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-14 18:05:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-11-14 18:05:42,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:42,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand 521 states. [2018-11-14 18:05:42,409 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand 521 states. [2018-11-14 18:05:42,409 INFO L87 Difference]: Start difference. First operand 523 states. Second operand 521 states. [2018-11-14 18:05:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:42,429 INFO L93 Difference]: Finished difference Result 523 states and 824 transitions. [2018-11-14 18:05:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 824 transitions. [2018-11-14 18:05:42,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:42,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:42,430 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand 523 states. [2018-11-14 18:05:42,431 INFO L87 Difference]: Start difference. First operand 521 states. Second operand 523 states. [2018-11-14 18:05:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:42,449 INFO L93 Difference]: Finished difference Result 523 states and 824 transitions. [2018-11-14 18:05:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 824 transitions. [2018-11-14 18:05:42,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:42,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:42,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:42,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-14 18:05:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-11-14 18:05:42,468 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-11-14 18:05:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:42,469 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-11-14 18:05:42,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-11-14 18:05:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:42,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:42,470 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] [2018-11-14 18:05:42,470 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:42,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-11-14 18:05:42,471 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:42,471 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:05:42,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:42,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:42,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {14045#true} call ULTIMATE.init(); {14045#true} is VALID [2018-11-14 18:05:42,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {14045#true} assume true; {14045#true} is VALID [2018-11-14 18:05:42,586 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14045#true} {14045#true} #198#return; {14045#true} is VALID [2018-11-14 18:05:42,587 INFO L256 TraceCheckUtils]: 3: Hoare triple {14045#true} call #t~ret11 := main(); {14045#true} is VALID [2018-11-14 18:05:42,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {14045#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;havoc ~cond~0; {14045#true} is VALID [2018-11-14 18:05:42,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {14045#true} assume true; {14045#true} is VALID [2018-11-14 18:05:42,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {14045#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {14045#true} is VALID [2018-11-14 18:05:42,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {14045#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; {14045#true} is VALID [2018-11-14 18:05:42,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {14045#true} assume !(~p1~0 != 0bv32); {14045#true} is VALID [2018-11-14 18:05:42,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {14045#true} assume !(~p2~0 != 0bv32); {14045#true} is VALID [2018-11-14 18:05:42,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {14045#true} assume !(~p3~0 != 0bv32); {14045#true} is VALID [2018-11-14 18:05:42,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {14045#true} assume !(~p4~0 != 0bv32); {14045#true} is VALID [2018-11-14 18:05:42,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {14045#true} assume !(~p5~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:05:42,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {14046#false} is VALID [2018-11-14 18:05:42,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {14046#false} assume ~lk5~0 != 1bv32; {14046#false} is VALID [2018-11-14 18:05:42,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {14046#false} assume !false; {14046#false} is VALID [2018-11-14 18:05:42,596 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:05:42,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:42,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:42,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:42,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:42,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:42,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:42,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:42,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:42,624 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-11-14 18:05:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:43,166 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-11-14 18:05:43,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:43,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 18:05:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 18:05:43,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2018-11-14 18:05:43,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:43,425 INFO L225 Difference]: With dead ends: 1501 [2018-11-14 18:05:43,426 INFO L226 Difference]: Without dead ends: 1003 [2018-11-14 18:05:43,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:05:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-14 18:05:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-11-14 18:05:43,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:43,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand 1001 states. [2018-11-14 18:05:43,729 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand 1001 states. [2018-11-14 18:05:43,729 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand 1001 states. [2018-11-14 18:05:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:43,776 INFO L93 Difference]: Finished difference Result 1003 states and 1544 transitions. [2018-11-14 18:05:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1544 transitions. [2018-11-14 18:05:43,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:43,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:43,778 INFO L74 IsIncluded]: Start isIncluded. First operand 1001 states. Second operand 1003 states. [2018-11-14 18:05:43,778 INFO L87 Difference]: Start difference. First operand 1001 states. Second operand 1003 states. [2018-11-14 18:05:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:43,824 INFO L93 Difference]: Finished difference Result 1003 states and 1544 transitions. [2018-11-14 18:05:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1544 transitions. [2018-11-14 18:05:43,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:43,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:43,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:43,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-14 18:05:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-11-14 18:05:43,904 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-11-14 18:05:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:43,904 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-11-14 18:05:43,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-11-14 18:05:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:05:43,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:43,906 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] [2018-11-14 18:05:43,906 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:43,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-11-14 18:05:43,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:43,910 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:05:43,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:43,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:44,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {18724#true} call ULTIMATE.init(); {18724#true} is VALID [2018-11-14 18:05:44,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {18724#true} assume true; {18724#true} is VALID [2018-11-14 18:05:44,069 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18724#true} {18724#true} #198#return; {18724#true} is VALID [2018-11-14 18:05:44,070 INFO L256 TraceCheckUtils]: 3: Hoare triple {18724#true} call #t~ret11 := main(); {18724#true} is VALID [2018-11-14 18:05:44,070 INFO L273 TraceCheckUtils]: 4: Hoare triple {18724#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;havoc ~cond~0; {18724#true} is VALID [2018-11-14 18:05:44,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {18724#true} assume true; {18724#true} is VALID [2018-11-14 18:05:44,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {18724#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {18724#true} is VALID [2018-11-14 18:05:44,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {18724#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; {18724#true} is VALID [2018-11-14 18:05:44,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {18724#true} assume !(~p1~0 != 0bv32); {18724#true} is VALID [2018-11-14 18:05:44,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {18724#true} assume !(~p2~0 != 0bv32); {18724#true} is VALID [2018-11-14 18:05:44,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {18724#true} assume !(~p3~0 != 0bv32); {18724#true} is VALID [2018-11-14 18:05:44,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {18724#true} assume !(~p4~0 != 0bv32); {18724#true} is VALID [2018-11-14 18:05:44,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {18724#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:44,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {18725#false} is VALID [2018-11-14 18:05:44,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {18725#false} assume !false; {18725#false} is VALID [2018-11-14 18:05:44,084 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:05:44,084 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:44,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:44,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:44,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:44,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:44,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:44,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:44,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:44,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:44,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:44,109 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-11-14 18:05:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:44,837 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-11-14 18:05:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:44,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 18:05:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-14 18:05:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-14 18:05:44,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-14 18:05:44,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:45,018 INFO L225 Difference]: With dead ends: 1213 [2018-11-14 18:05:45,018 INFO L226 Difference]: Without dead ends: 1211 [2018-11-14 18:05:45,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:05:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-14 18:05:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-11-14 18:05:45,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:45,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1211 states. Second operand 1001 states. [2018-11-14 18:05:45,615 INFO L74 IsIncluded]: Start isIncluded. First operand 1211 states. Second operand 1001 states. [2018-11-14 18:05:45,616 INFO L87 Difference]: Start difference. First operand 1211 states. Second operand 1001 states. [2018-11-14 18:05:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:45,667 INFO L93 Difference]: Finished difference Result 1211 states and 1896 transitions. [2018-11-14 18:05:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1896 transitions. [2018-11-14 18:05:45,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:45,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:45,669 INFO L74 IsIncluded]: Start isIncluded. First operand 1001 states. Second operand 1211 states. [2018-11-14 18:05:45,669 INFO L87 Difference]: Start difference. First operand 1001 states. Second operand 1211 states. [2018-11-14 18:05:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:45,733 INFO L93 Difference]: Finished difference Result 1211 states and 1896 transitions. [2018-11-14 18:05:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1896 transitions. [2018-11-14 18:05:45,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:45,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:45,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:45,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-14 18:05:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-11-14 18:05:45,769 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-11-14 18:05:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:45,769 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-11-14 18:05:45,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-11-14 18:05:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:05:45,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:45,770 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:05:45,770 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:45,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-11-14 18:05:45,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:45,770 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:05:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:45,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:45,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {23531#true} call ULTIMATE.init(); {23531#true} is VALID [2018-11-14 18:05:45,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {23531#true} assume true; {23531#true} is VALID [2018-11-14 18:05:45,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23531#true} {23531#true} #198#return; {23531#true} is VALID [2018-11-14 18:05:45,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {23531#true} call #t~ret11 := main(); {23531#true} is VALID [2018-11-14 18:05:45,984 INFO L273 TraceCheckUtils]: 4: Hoare triple {23531#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;havoc ~cond~0; {23531#true} is VALID [2018-11-14 18:05:45,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {23531#true} assume true; {23531#true} is VALID [2018-11-14 18:05:45,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {23531#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {23531#true} is VALID [2018-11-14 18:05:45,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {23531#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; {23531#true} is VALID [2018-11-14 18:05:45,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {23531#true} assume !(~p1~0 != 0bv32); {23531#true} is VALID [2018-11-14 18:05:45,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {23531#true} assume !(~p2~0 != 0bv32); {23531#true} is VALID [2018-11-14 18:05:45,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {23531#true} assume !(~p3~0 != 0bv32); {23531#true} is VALID [2018-11-14 18:05:45,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {23531#true} assume !(~p4~0 != 0bv32); {23531#true} is VALID [2018-11-14 18:05:45,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {23531#true} assume !(~p5~0 != 0bv32); {23531#true} is VALID [2018-11-14 18:05:45,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {23531#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:45,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {23532#false} is VALID [2018-11-14 18:05:45,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {23532#false} assume !false; {23532#false} is VALID [2018-11-14 18:05:45,991 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:05:45,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:45,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:45,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:45,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:45,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:45,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:46,016 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:05:46,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:46,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:46,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:46,017 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-11-14 18:05:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:46,985 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-11-14 18:05:46,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:46,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2018-11-14 18:05:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2018-11-14 18:05:46,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2018-11-14 18:05:47,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:47,249 INFO L225 Difference]: With dead ends: 1789 [2018-11-14 18:05:47,249 INFO L226 Difference]: Without dead ends: 1787 [2018-11-14 18:05:47,250 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:05:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-14 18:05:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-11-14 18:05:48,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:48,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1787 states. Second operand 1433 states. [2018-11-14 18:05:48,024 INFO L74 IsIncluded]: Start isIncluded. First operand 1787 states. Second operand 1433 states. [2018-11-14 18:05:48,024 INFO L87 Difference]: Start difference. First operand 1787 states. Second operand 1433 states. [2018-11-14 18:05:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:48,127 INFO L93 Difference]: Finished difference Result 1787 states and 2744 transitions. [2018-11-14 18:05:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2744 transitions. [2018-11-14 18:05:48,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:48,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:48,129 INFO L74 IsIncluded]: Start isIncluded. First operand 1433 states. Second operand 1787 states. [2018-11-14 18:05:48,129 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand 1787 states. [2018-11-14 18:05:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:48,236 INFO L93 Difference]: Finished difference Result 1787 states and 2744 transitions. [2018-11-14 18:05:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2744 transitions. [2018-11-14 18:05:48,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:48,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:48,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:48,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-11-14 18:05:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-11-14 18:05:48,304 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-11-14 18:05:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:48,304 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-11-14 18:05:48,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-11-14 18:05:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:05:48,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:48,306 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:05:48,306 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:48,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-11-14 18:05:48,307 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:48,307 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:05:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:48,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:48,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {30517#true} call ULTIMATE.init(); {30517#true} is VALID [2018-11-14 18:05:48,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {30517#true} assume true; {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30517#true} {30517#true} #198#return; {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L256 TraceCheckUtils]: 3: Hoare triple {30517#true} call #t~ret11 := main(); {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L273 TraceCheckUtils]: 4: Hoare triple {30517#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;havoc ~cond~0; {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {30517#true} assume true; {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {30517#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {30517#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; {30517#true} is VALID [2018-11-14 18:05:48,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {30517#true} assume !(~p1~0 != 0bv32); {30517#true} is VALID [2018-11-14 18:05:48,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {30517#true} assume !(~p2~0 != 0bv32); {30517#true} is VALID [2018-11-14 18:05:48,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {30517#true} assume !(~p3~0 != 0bv32); {30517#true} is VALID [2018-11-14 18:05:48,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {30517#true} assume !(~p4~0 != 0bv32); {30517#true} is VALID [2018-11-14 18:05:48,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {30517#true} assume !(~p5~0 != 0bv32); {30517#true} is VALID [2018-11-14 18:05:48,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {30517#true} assume !(~p6~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 18:05:48,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {30518#false} is VALID [2018-11-14 18:05:48,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {30518#false} assume ~lk6~0 != 1bv32; {30518#false} is VALID [2018-11-14 18:05:48,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {30518#false} assume !false; {30518#false} is VALID [2018-11-14 18:05:48,435 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:05:48,435 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:48,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:48,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:48,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:48,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:48,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:48,462 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:05:48,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:48,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:48,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:48,463 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-11-14 18:05:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:49,616 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-11-14 18:05:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:49,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 18:05:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-14 18:05:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-14 18:05:49,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2018-11-14 18:05:49,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:49,967 INFO L225 Difference]: With dead ends: 3357 [2018-11-14 18:05:49,967 INFO L226 Difference]: Without dead ends: 1947 [2018-11-14 18:05:49,970 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:05:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-11-14 18:05:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-11-14 18:05:50,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:50,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1947 states. Second operand 1945 states. [2018-11-14 18:05:50,632 INFO L74 IsIncluded]: Start isIncluded. First operand 1947 states. Second operand 1945 states. [2018-11-14 18:05:50,632 INFO L87 Difference]: Start difference. First operand 1947 states. Second operand 1945 states. [2018-11-14 18:05:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:50,769 INFO L93 Difference]: Finished difference Result 1947 states and 2856 transitions. [2018-11-14 18:05:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2856 transitions. [2018-11-14 18:05:50,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:50,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:50,771 INFO L74 IsIncluded]: Start isIncluded. First operand 1945 states. Second operand 1947 states. [2018-11-14 18:05:50,772 INFO L87 Difference]: Start difference. First operand 1945 states. Second operand 1947 states. [2018-11-14 18:05:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:50,890 INFO L93 Difference]: Finished difference Result 1947 states and 2856 transitions. [2018-11-14 18:05:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2856 transitions. [2018-11-14 18:05:50,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:50,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:50,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:50,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-14 18:05:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-11-14 18:05:51,021 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-11-14 18:05:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:51,021 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-11-14 18:05:51,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-11-14 18:05:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:05:51,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:51,023 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:05:51,023 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:51,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-11-14 18:05:51,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:51,024 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:05:51,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:51,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:51,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {39967#true} call ULTIMATE.init(); {39967#true} is VALID [2018-11-14 18:05:51,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {39967#true} assume true; {39967#true} is VALID [2018-11-14 18:05:51,131 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {39967#true} {39967#true} #198#return; {39967#true} is VALID [2018-11-14 18:05:51,131 INFO L256 TraceCheckUtils]: 3: Hoare triple {39967#true} call #t~ret11 := main(); {39967#true} is VALID [2018-11-14 18:05:51,131 INFO L273 TraceCheckUtils]: 4: Hoare triple {39967#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;havoc ~cond~0; {39967#true} is VALID [2018-11-14 18:05:51,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {39967#true} assume true; {39967#true} is VALID [2018-11-14 18:05:51,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {39967#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {39967#true} is VALID [2018-11-14 18:05:51,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {39967#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; {39967#true} is VALID [2018-11-14 18:05:51,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {39967#true} assume !(~p1~0 != 0bv32); {39967#true} is VALID [2018-11-14 18:05:51,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {39967#true} assume !(~p2~0 != 0bv32); {39967#true} is VALID [2018-11-14 18:05:51,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {39967#true} assume !(~p3~0 != 0bv32); {39967#true} is VALID [2018-11-14 18:05:51,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {39967#true} assume !(~p4~0 != 0bv32); {39967#true} is VALID [2018-11-14 18:05:51,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {39967#true} assume !(~p5~0 != 0bv32); {39967#true} is VALID [2018-11-14 18:05:51,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {39967#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 18:05:51,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {39968#false} is VALID [2018-11-14 18:05:51,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {39968#false} assume ~p7~0 != 0bv32; {39968#false} is VALID [2018-11-14 18:05:51,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {39968#false} assume ~lk7~0 != 1bv32; {39968#false} is VALID [2018-11-14 18:05:51,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {39968#false} assume !false; {39968#false} is VALID [2018-11-14 18:05:51,144 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:05:51,144 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:51,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:51,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:51,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:51,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:51,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:51,177 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:05:51,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:51,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:51,178 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-11-14 18:05:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:52,641 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-11-14 18:05:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:52,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-14 18:05:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-14 18:05:52,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-14 18:05:52,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:53,022 INFO L225 Difference]: With dead ends: 2941 [2018-11-14 18:05:53,022 INFO L226 Difference]: Without dead ends: 1995 [2018-11-14 18:05:53,024 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:05:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-11-14 18:05:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-11-14 18:05:53,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:53,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1995 states. Second operand 1993 states. [2018-11-14 18:05:53,885 INFO L74 IsIncluded]: Start isIncluded. First operand 1995 states. Second operand 1993 states. [2018-11-14 18:05:53,886 INFO L87 Difference]: Start difference. First operand 1995 states. Second operand 1993 states. [2018-11-14 18:05:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:54,046 INFO L93 Difference]: Finished difference Result 1995 states and 2888 transitions. [2018-11-14 18:05:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2888 transitions. [2018-11-14 18:05:54,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:54,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:54,049 INFO L74 IsIncluded]: Start isIncluded. First operand 1993 states. Second operand 1995 states. [2018-11-14 18:05:54,049 INFO L87 Difference]: Start difference. First operand 1993 states. Second operand 1995 states. [2018-11-14 18:05:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:54,191 INFO L93 Difference]: Finished difference Result 1995 states and 2888 transitions. [2018-11-14 18:05:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2888 transitions. [2018-11-14 18:05:54,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:54,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:54,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:54,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-14 18:05:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-11-14 18:05:54,347 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-11-14 18:05:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:54,347 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-11-14 18:05:54,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-11-14 18:05:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:05:54,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:54,349 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:05:54,349 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:54,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-11-14 18:05:54,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:54,350 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:05:54,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:54,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:54,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {49148#true} call ULTIMATE.init(); {49148#true} is VALID [2018-11-14 18:05:54,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {49148#true} assume true; {49148#true} is VALID [2018-11-14 18:05:54,547 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {49148#true} {49148#true} #198#return; {49148#true} is VALID [2018-11-14 18:05:54,547 INFO L256 TraceCheckUtils]: 3: Hoare triple {49148#true} call #t~ret11 := main(); {49148#true} is VALID [2018-11-14 18:05:54,547 INFO L273 TraceCheckUtils]: 4: Hoare triple {49148#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;havoc ~cond~0; {49148#true} is VALID [2018-11-14 18:05:54,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {49148#true} assume true; {49148#true} is VALID [2018-11-14 18:05:54,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {49148#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {49148#true} is VALID [2018-11-14 18:05:54,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {49148#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; {49148#true} is VALID [2018-11-14 18:05:54,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {49148#true} assume !(~p1~0 != 0bv32); {49148#true} is VALID [2018-11-14 18:05:54,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {49148#true} assume !(~p2~0 != 0bv32); {49148#true} is VALID [2018-11-14 18:05:54,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {49148#true} assume !(~p3~0 != 0bv32); {49148#true} is VALID [2018-11-14 18:05:54,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {49148#true} assume !(~p4~0 != 0bv32); {49148#true} is VALID [2018-11-14 18:05:54,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {49148#true} assume !(~p5~0 != 0bv32); {49148#true} is VALID [2018-11-14 18:05:54,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {49148#true} assume !(~p6~0 != 0bv32); {49148#true} is VALID [2018-11-14 18:05:54,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {49148#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:05:54,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {49149#false} is VALID [2018-11-14 18:05:54,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {49149#false} assume !false; {49149#false} is VALID [2018-11-14 18:05:54,574 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:05:54,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:54,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:54,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:54,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:54,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:54,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:54,607 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:05:54,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:54,608 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-11-14 18:05:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:56,037 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-11-14 18:05:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:05:56,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:05:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-14 18:05:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:05:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-14 18:05:56,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2018-11-14 18:05:56,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:05:56,690 INFO L225 Difference]: With dead ends: 3469 [2018-11-14 18:05:56,690 INFO L226 Difference]: Without dead ends: 3467 [2018-11-14 18:05:56,691 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:05:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-14 18:05:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-11-14 18:05:57,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:05:57,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3467 states. Second operand 2889 states. [2018-11-14 18:05:57,495 INFO L74 IsIncluded]: Start isIncluded. First operand 3467 states. Second operand 2889 states. [2018-11-14 18:05:57,496 INFO L87 Difference]: Start difference. First operand 3467 states. Second operand 2889 states. [2018-11-14 18:05:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:57,936 INFO L93 Difference]: Finished difference Result 3467 states and 5032 transitions. [2018-11-14 18:05:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5032 transitions. [2018-11-14 18:05:57,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:57,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:57,940 INFO L74 IsIncluded]: Start isIncluded. First operand 2889 states. Second operand 3467 states. [2018-11-14 18:05:57,940 INFO L87 Difference]: Start difference. First operand 2889 states. Second operand 3467 states. [2018-11-14 18:05:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:05:58,384 INFO L93 Difference]: Finished difference Result 3467 states and 5032 transitions. [2018-11-14 18:05:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5032 transitions. [2018-11-14 18:05:58,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:05:58,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:05:58,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:05:58,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:05:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-11-14 18:05:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-11-14 18:05:58,704 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-11-14 18:05:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:05:58,704 INFO L480 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-11-14 18:05:58,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:05:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-11-14 18:05:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:05:58,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:05:58,706 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:05:58,707 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:05:58,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:05:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-11-14 18:05:58,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:05:58,707 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:05:58,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:05:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:05:58,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:05:58,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {62729#true} call ULTIMATE.init(); {62729#true} is VALID [2018-11-14 18:05:58,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {62729#true} assume true; {62729#true} is VALID [2018-11-14 18:05:58,810 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {62729#true} {62729#true} #198#return; {62729#true} is VALID [2018-11-14 18:05:58,810 INFO L256 TraceCheckUtils]: 3: Hoare triple {62729#true} call #t~ret11 := main(); {62729#true} is VALID [2018-11-14 18:05:58,810 INFO L273 TraceCheckUtils]: 4: Hoare triple {62729#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;havoc ~cond~0; {62729#true} is VALID [2018-11-14 18:05:58,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {62729#true} assume true; {62729#true} is VALID [2018-11-14 18:05:58,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {62729#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {62729#true} is VALID [2018-11-14 18:05:58,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {62729#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; {62729#true} is VALID [2018-11-14 18:05:58,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {62729#true} assume !(~p1~0 != 0bv32); {62729#true} is VALID [2018-11-14 18:05:58,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {62729#true} assume !(~p2~0 != 0bv32); {62729#true} is VALID [2018-11-14 18:05:58,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {62729#true} assume !(~p3~0 != 0bv32); {62729#true} is VALID [2018-11-14 18:05:58,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {62729#true} assume !(~p4~0 != 0bv32); {62729#true} is VALID [2018-11-14 18:05:58,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {62729#true} assume !(~p5~0 != 0bv32); {62729#true} is VALID [2018-11-14 18:05:58,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {62729#true} assume !(~p6~0 != 0bv32); {62729#true} is VALID [2018-11-14 18:05:58,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {62729#true} assume !(~p7~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,815 INFO L273 TraceCheckUtils]: 21: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 18:05:58,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {62730#false} is VALID [2018-11-14 18:05:58,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {62730#false} assume ~lk7~0 != 1bv32; {62730#false} is VALID [2018-11-14 18:05:58,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {62730#false} assume !false; {62730#false} is VALID [2018-11-14 18:05:58,817 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:05:58,818 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:05:58,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:05:58,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:05:58,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:05:58,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:05:58,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:05:58,847 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:05:58,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:05:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:05:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:05:58,848 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-11-14 18:06:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:02,312 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-11-14 18:06:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:02,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 18:06:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-14 18:06:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-14 18:06:02,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2018-11-14 18:06:02,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:03,195 INFO L225 Difference]: With dead ends: 6669 [2018-11-14 18:06:03,195 INFO L226 Difference]: Without dead ends: 3851 [2018-11-14 18:06:03,199 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:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-14 18:06:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-11-14 18:06:04,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:04,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3851 states. Second operand 3849 states. [2018-11-14 18:06:04,157 INFO L74 IsIncluded]: Start isIncluded. First operand 3851 states. Second operand 3849 states. [2018-11-14 18:06:04,157 INFO L87 Difference]: Start difference. First operand 3851 states. Second operand 3849 states. [2018-11-14 18:06:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:04,701 INFO L93 Difference]: Finished difference Result 3851 states and 5320 transitions. [2018-11-14 18:06:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5320 transitions. [2018-11-14 18:06:04,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:04,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:04,705 INFO L74 IsIncluded]: Start isIncluded. First operand 3849 states. Second operand 3851 states. [2018-11-14 18:06:04,705 INFO L87 Difference]: Start difference. First operand 3849 states. Second operand 3851 states. [2018-11-14 18:06:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:05,253 INFO L93 Difference]: Finished difference Result 3851 states and 5320 transitions. [2018-11-14 18:06:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5320 transitions. [2018-11-14 18:06:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:05,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:05,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:05,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-11-14 18:06:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-11-14 18:06:05,890 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-11-14 18:06:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:05,890 INFO L480 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-11-14 18:06:05,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-11-14 18:06:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:05,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:05,893 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:05,893 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:05,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-11-14 18:06:05,894 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:05,894 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:06:05,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:05,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:05,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {81366#true} call ULTIMATE.init(); {81366#true} is VALID [2018-11-14 18:06:05,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {81366#true} assume true; {81366#true} is VALID [2018-11-14 18:06:05,991 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {81366#true} {81366#true} #198#return; {81366#true} is VALID [2018-11-14 18:06:05,991 INFO L256 TraceCheckUtils]: 3: Hoare triple {81366#true} call #t~ret11 := main(); {81366#true} is VALID [2018-11-14 18:06:05,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {81366#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;havoc ~cond~0; {81366#true} is VALID [2018-11-14 18:06:05,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {81366#true} assume true; {81366#true} is VALID [2018-11-14 18:06:05,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {81366#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {81366#true} is VALID [2018-11-14 18:06:05,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {81366#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; {81366#true} is VALID [2018-11-14 18:06:05,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {81366#true} assume !(~p1~0 != 0bv32); {81366#true} is VALID [2018-11-14 18:06:05,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {81366#true} assume !(~p2~0 != 0bv32); {81366#true} is VALID [2018-11-14 18:06:05,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {81366#true} assume !(~p3~0 != 0bv32); {81366#true} is VALID [2018-11-14 18:06:05,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {81366#true} assume !(~p4~0 != 0bv32); {81366#true} is VALID [2018-11-14 18:06:05,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {81366#true} assume !(~p5~0 != 0bv32); {81366#true} is VALID [2018-11-14 18:06:05,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {81366#true} assume !(~p6~0 != 0bv32); {81366#true} is VALID [2018-11-14 18:06:05,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {81366#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 18:06:05,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {81367#false} is VALID [2018-11-14 18:06:05,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {81367#false} assume ~p8~0 != 0bv32; {81367#false} is VALID [2018-11-14 18:06:05,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {81367#false} assume ~lk8~0 != 1bv32; {81367#false} is VALID [2018-11-14 18:06:05,998 INFO L273 TraceCheckUtils]: 27: Hoare triple {81367#false} assume !false; {81367#false} is VALID [2018-11-14 18:06:05,999 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:05,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:06,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:06,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:06,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:06,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:06,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:06,026 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:06,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:06,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:06,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:06,027 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-11-14 18:06:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:08,932 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-11-14 18:06:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:08,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-14 18:06:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-14 18:06:08,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2018-11-14 18:06:09,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:09,836 INFO L225 Difference]: With dead ends: 5773 [2018-11-14 18:06:09,836 INFO L226 Difference]: Without dead ends: 3915 [2018-11-14 18:06:09,840 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:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-11-14 18:06:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-11-14 18:06:11,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:11,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3915 states. Second operand 3913 states. [2018-11-14 18:06:11,649 INFO L74 IsIncluded]: Start isIncluded. First operand 3915 states. Second operand 3913 states. [2018-11-14 18:06:11,649 INFO L87 Difference]: Start difference. First operand 3915 states. Second operand 3913 states. [2018-11-14 18:06:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,217 INFO L93 Difference]: Finished difference Result 3915 states and 5320 transitions. [2018-11-14 18:06:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 5320 transitions. [2018-11-14 18:06:12,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,222 INFO L74 IsIncluded]: Start isIncluded. First operand 3913 states. Second operand 3915 states. [2018-11-14 18:06:12,222 INFO L87 Difference]: Start difference. First operand 3913 states. Second operand 3915 states. [2018-11-14 18:06:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,793 INFO L93 Difference]: Finished difference Result 3915 states and 5320 transitions. [2018-11-14 18:06:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 5320 transitions. [2018-11-14 18:06:12,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:12,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-14 18:06:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-11-14 18:06:13,426 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-11-14 18:06:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:13,426 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-11-14 18:06:13,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-11-14 18:06:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:13,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:13,429 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,429 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:13,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-11-14 18:06:13,429 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:13,429 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:06:13,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:13,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {99302#true} call ULTIMATE.init(); {99302#true} is VALID [2018-11-14 18:06:13,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {99302#true} assume true; {99302#true} is VALID [2018-11-14 18:06:13,530 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {99302#true} {99302#true} #198#return; {99302#true} is VALID [2018-11-14 18:06:13,530 INFO L256 TraceCheckUtils]: 3: Hoare triple {99302#true} call #t~ret11 := main(); {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 4: Hoare triple {99302#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;havoc ~cond~0; {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {99302#true} assume true; {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {99302#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {99302#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; {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {99302#true} assume !(~p1~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {99302#true} assume !(~p2~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {99302#true} assume !(~p3~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {99302#true} assume !(~p4~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {99302#true} assume !(~p5~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {99302#true} assume !(~p6~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {99302#true} assume !(~p7~0 != 0bv32); {99302#true} is VALID [2018-11-14 18:06:13,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {99302#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {99303#false} is VALID [2018-11-14 18:06:13,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {99303#false} assume !false; {99303#false} is VALID [2018-11-14 18:06:13,541 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,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:13,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:13,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:13,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:13,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:13,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:13,582 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,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,583 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-11-14 18:06:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:17,996 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-11-14 18:06:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:17,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 18:06:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 18:06:17,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-14 18:06:18,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:20,006 INFO L225 Difference]: With dead ends: 6669 [2018-11-14 18:06:20,006 INFO L226 Difference]: Without dead ends: 6667 [2018-11-14 18:06:20,007 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:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-11-14 18:06:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-11-14 18:06:21,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:21,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand 5769 states. [2018-11-14 18:06:21,838 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand 5769 states. [2018-11-14 18:06:21,838 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand 5769 states. [2018-11-14 18:06:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:23,524 INFO L93 Difference]: Finished difference Result 6667 states and 9032 transitions. [2018-11-14 18:06:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 9032 transitions. [2018-11-14 18:06:23,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:23,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:23,533 INFO L74 IsIncluded]: Start isIncluded. First operand 5769 states. Second operand 6667 states. [2018-11-14 18:06:23,533 INFO L87 Difference]: Start difference. First operand 5769 states. Second operand 6667 states. [2018-11-14 18:06:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:25,288 INFO L93 Difference]: Finished difference Result 6667 states and 9032 transitions. [2018-11-14 18:06:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 9032 transitions. [2018-11-14 18:06:25,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:25,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:25,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:25,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-14 18:06:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-11-14 18:06:26,661 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-11-14 18:06:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:26,662 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-11-14 18:06:26,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-11-14 18:06:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:06:26,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:26,665 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:26,665 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:26,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:26,666 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-11-14 18:06:26,666 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:26,666 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:26,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:26,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:26,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {125558#true} call ULTIMATE.init(); {125558#true} is VALID [2018-11-14 18:06:26,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {125558#true} assume true; {125558#true} is VALID [2018-11-14 18:06:26,772 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {125558#true} {125558#true} #198#return; {125558#true} is VALID [2018-11-14 18:06:26,772 INFO L256 TraceCheckUtils]: 3: Hoare triple {125558#true} call #t~ret11 := main(); {125558#true} is VALID [2018-11-14 18:06:26,772 INFO L273 TraceCheckUtils]: 4: Hoare triple {125558#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;havoc ~cond~0; {125558#true} is VALID [2018-11-14 18:06:26,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {125558#true} assume true; {125558#true} is VALID [2018-11-14 18:06:26,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {125558#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {125558#true} is VALID [2018-11-14 18:06:26,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {125558#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; {125558#true} is VALID [2018-11-14 18:06:26,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {125558#true} assume !(~p1~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {125558#true} assume !(~p2~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {125558#true} assume !(~p3~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {125558#true} assume !(~p4~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {125558#true} assume !(~p5~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {125558#true} assume !(~p6~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {125558#true} assume !(~p7~0 != 0bv32); {125558#true} is VALID [2018-11-14 18:06:26,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {125558#true} assume !(~p8~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p1~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p2~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,777 INFO L273 TraceCheckUtils]: 20: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p3~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p4~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p5~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p6~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p7~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 18:06:26,779 INFO L273 TraceCheckUtils]: 25: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume ~p8~0 != 0bv32; {125559#false} is VALID [2018-11-14 18:06:26,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {125559#false} assume ~lk8~0 != 1bv32; {125559#false} is VALID [2018-11-14 18:06:26,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {125559#false} assume !false; {125559#false} is VALID [2018-11-14 18:06:26,779 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:26,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:26,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:26,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:26,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:26,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:26,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:26,806 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:26,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:26,807 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-11-14 18:06:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:38,251 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-11-14 18:06:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:38,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 18:06:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-14 18:06:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-14 18:06:38,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-14 18:06:38,436 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:41,005 INFO L225 Difference]: With dead ends: 13197 [2018-11-14 18:06:41,005 INFO L226 Difference]: Without dead ends: 7563 [2018-11-14 18:06:41,011 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:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-11-14 18:06:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-11-14 18:06:45,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:45,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7563 states. Second operand 7561 states. [2018-11-14 18:06:45,242 INFO L74 IsIncluded]: Start isIncluded. First operand 7563 states. Second operand 7561 states. [2018-11-14 18:06:45,242 INFO L87 Difference]: Start difference. First operand 7563 states. Second operand 7561 states. [2018-11-14 18:06:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:47,267 INFO L93 Difference]: Finished difference Result 7563 states and 9736 transitions. [2018-11-14 18:06:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 9736 transitions. [2018-11-14 18:06:47,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:47,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:47,273 INFO L74 IsIncluded]: Start isIncluded. First operand 7561 states. Second operand 7563 states. [2018-11-14 18:06:47,273 INFO L87 Difference]: Start difference. First operand 7561 states. Second operand 7563 states. [2018-11-14 18:06:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:49,461 INFO L93 Difference]: Finished difference Result 7563 states and 9736 transitions. [2018-11-14 18:06:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 9736 transitions. [2018-11-14 18:06:49,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:49,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:49,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:49,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-11-14 18:06:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-11-14 18:06:51,791 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-11-14 18:06:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:51,791 INFO L480 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-11-14 18:06:51,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-11-14 18:06:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:06:51,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:51,795 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:51,795 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:51,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-11-14 18:06:51,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:51,796 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:51,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:51,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:51,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {162182#true} call ULTIMATE.init(); {162182#true} is VALID [2018-11-14 18:06:51,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {162182#true} assume true; {162182#true} is VALID [2018-11-14 18:06:51,896 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {162182#true} {162182#true} #198#return; {162182#true} is VALID [2018-11-14 18:06:51,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {162182#true} call #t~ret11 := main(); {162182#true} is VALID [2018-11-14 18:06:51,896 INFO L273 TraceCheckUtils]: 4: Hoare triple {162182#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;havoc ~cond~0; {162182#true} is VALID [2018-11-14 18:06:51,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {162182#true} assume true; {162182#true} is VALID [2018-11-14 18:06:51,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {162182#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {162182#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; {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {162182#true} assume !(~p1~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {162182#true} assume !(~p2~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {162182#true} assume !(~p3~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {162182#true} assume !(~p4~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {162182#true} assume !(~p5~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {162182#true} assume !(~p6~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {162182#true} assume !(~p7~0 != 0bv32); {162182#true} is VALID [2018-11-14 18:06:51,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {162182#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p1~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p2~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p3~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p4~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p5~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p6~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p7~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 18:06:51,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p8~0 != 0bv32); {162183#false} is VALID [2018-11-14 18:06:51,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {162183#false} assume ~p9~0 != 0bv32; {162183#false} is VALID [2018-11-14 18:06:51,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {162183#false} assume ~lk9~0 != 1bv32; {162183#false} is VALID [2018-11-14 18:06:51,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {162183#false} assume !false; {162183#false} is VALID [2018-11-14 18:06:51,904 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:51,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:51,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:51,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:51,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:06:51,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:51,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:51,934 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:51,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:51,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:51,935 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-11-14 18:07:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:07:00,025 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-11-14 18:07:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:07:00,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:07:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:07:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-14 18:07:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:07:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-14 18:07:00,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions.