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.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:15:52,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:15:52,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:15:52,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:15:52,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:15:52,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:15:52,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:15:52,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:15:52,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:15:52,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:15:52,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:15:52,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:15:52,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:15:52,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:15:52,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:15:52,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:15:52,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:15:52,598 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:15:52,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:15:52,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:15:52,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:15:52,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:15:52,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:15:52,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:15:52,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:15:52,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:15:52,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:15:52,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:15:52,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:15:52,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:15:52,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:15:52,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:15:52,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:15:52,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:15:52,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:15:52,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:15:52,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:15:52,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:15:52,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:15:52,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:15:52,643 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:15:52,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:15:52,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:15:52,647 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:15:52,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:15:52,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:15:52,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:15:52,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:15:52,648 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:15:52,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:15:52,648 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:15:52,649 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:15:52,650 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:15:52,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:15:52,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:15:52,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:15:52,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:15:52,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:15:52,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:15:52,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:15:52,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:15:52,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:15:52,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:15:52,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:15:52,653 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:15:52,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:15:52,654 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:15:52,654 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:15:52,654 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:15:52,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:15:52,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:15:52,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:15:52,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:15:52,733 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:15:52,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:15:52,819 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388ebb6aa/fb28fce53f164dec8b8c3380cc6c217b/FLAGa1c3521fa [2018-11-14 16:15:53,341 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:15:53,342 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:15:53,354 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388ebb6aa/fb28fce53f164dec8b8c3380cc6c217b/FLAGa1c3521fa [2018-11-14 16:15:53,376 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388ebb6aa/fb28fce53f164dec8b8c3380cc6c217b [2018-11-14 16:15:53,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:15:53,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:15:53,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:15:53,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:15:53,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:15:53,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53, skipping insertion in model container [2018-11-14 16:15:53,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:15:53,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:15:53,695 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:15:53,707 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:15:53,742 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:15:53,760 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:15:53,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53 WrapperNode [2018-11-14 16:15:53,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:15:53,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:15:53,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:15:53,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:15:53,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (1/1) ... [2018-11-14 16:15:53,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:15:53,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:15:53,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:15:53,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:15:53,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (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 16:15:53,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:15:53,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:15:53,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:15:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:15:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:15:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:15:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:15:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:15:54,954 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:15:54,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:54 BoogieIcfgContainer [2018-11-14 16:15:54,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:15:54,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:15:54,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:15:54,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:15:54,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:15:53" (1/3) ... [2018-11-14 16:15:54,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2bf5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:54, skipping insertion in model container [2018-11-14 16:15:54,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:53" (2/3) ... [2018-11-14 16:15:54,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2bf5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:54, skipping insertion in model container [2018-11-14 16:15:54,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:54" (3/3) ... [2018-11-14 16:15:54,964 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:15:54,974 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:15:54,982 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:15:55,000 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:15:55,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:15:55,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:15:55,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:15:55,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:15:55,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:15:55,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:15:55,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:15:55,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:15:55,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:15:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 16:15:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:15:55,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:55,067 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 16:15:55,069 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:55,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-14 16:15:55,081 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:55,082 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 16:15:55,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:55,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:55,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 16:15:55,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 16:15:55,584 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #249#return; {57#true} is VALID [2018-11-14 16:15:55,584 INFO L256 TraceCheckUtils]: 3: Hoare triple {57#true} call #t~ret14 := main(); {57#true} is VALID [2018-11-14 16:15:55,585 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2018-11-14 16:15:55,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 16:15:55,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {57#true} is VALID [2018-11-14 16:15:55,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {57#true} is VALID [2018-11-14 16:15:55,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:55,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {58#false} is VALID [2018-11-14 16:15:55,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 16:15:55,623 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 16:15:55,623 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:55,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:55,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:55,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:55,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:55,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:55,712 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 16:15:55,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:55,724 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-14 16:15:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:56,824 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-14 16:15:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:56,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 16:15:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 16:15:56,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-14 16:15:57,464 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 16:15:57,481 INFO L225 Difference]: With dead ends: 107 [2018-11-14 16:15:57,482 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:15:57,485 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 16:15:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:15:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-14 16:15:57,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:57,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 63 states. [2018-11-14 16:15:57,541 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 63 states. [2018-11-14 16:15:57,541 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 63 states. [2018-11-14 16:15:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:57,553 INFO L93 Difference]: Finished difference Result 92 states and 166 transitions. [2018-11-14 16:15:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2018-11-14 16:15:57,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:57,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:57,558 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 92 states. [2018-11-14 16:15:57,558 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 92 states. [2018-11-14 16:15:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:57,570 INFO L93 Difference]: Finished difference Result 92 states and 166 transitions. [2018-11-14 16:15:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2018-11-14 16:15:57,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:57,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:57,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:57,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 16:15:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-14 16:15:57,580 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-14 16:15:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:57,582 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-14 16:15:57,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-14 16:15:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:15:57,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:57,584 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 16:15:57,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:57,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-14 16:15:57,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:57,587 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 16:15:57,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:57,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:57,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {503#true} is VALID [2018-11-14 16:15:57,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-14 16:15:57,771 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {503#true} {503#true} #249#return; {503#true} is VALID [2018-11-14 16:15:57,771 INFO L256 TraceCheckUtils]: 3: Hoare triple {503#true} call #t~ret14 := main(); {503#true} is VALID [2018-11-14 16:15:57,771 INFO L273 TraceCheckUtils]: 4: Hoare triple {503#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {503#true} is VALID [2018-11-14 16:15:57,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-14 16:15:57,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {503#true} is VALID [2018-11-14 16:15:57,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {503#true} is VALID [2018-11-14 16:15:57,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {503#true} assume !(~p1~0 != 0bv32); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume !(~p13~0 != 0bv32); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:57,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {504#false} is VALID [2018-11-14 16:15:57,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {504#false} assume ~lk1~0 != 1bv32; {504#false} is VALID [2018-11-14 16:15:57,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {504#false} assume !false; {504#false} is VALID [2018-11-14 16:15:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:15:57,792 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:57,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:57,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:57,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:57,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:57,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:57,835 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 16:15:57,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:57,837 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-14 16:15:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:58,193 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-14 16:15:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:58,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-14 16:15:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-14 16:15:58,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 248 transitions. [2018-11-14 16:15:58,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:58,655 INFO L225 Difference]: With dead ends: 150 [2018-11-14 16:15:58,655 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:15:58,657 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 16:15:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:15:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-14 16:15:58,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:58,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-14 16:15:58,759 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-14 16:15:58,759 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-14 16:15:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:58,764 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2018-11-14 16:15:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-11-14 16:15:58,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:58,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:58,766 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-14 16:15:58,766 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-14 16:15:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:58,771 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2018-11-14 16:15:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-11-14 16:15:58,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:58,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:58,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:58,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 16:15:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-14 16:15:58,778 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-14 16:15:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-14 16:15:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-14 16:15:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:15:58,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:58,780 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 16:15:58,780 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:58,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-14 16:15:58,781 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:58,782 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 16:15:58,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:58,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:58,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2018-11-14 16:15:58,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-14 16:15:58,902 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1018#true} {1018#true} #249#return; {1018#true} is VALID [2018-11-14 16:15:58,902 INFO L256 TraceCheckUtils]: 3: Hoare triple {1018#true} call #t~ret14 := main(); {1018#true} is VALID [2018-11-14 16:15:58,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {1018#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1018#true} is VALID [2018-11-14 16:15:58,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-14 16:15:58,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {1018#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1018#true} is VALID [2018-11-14 16:15:58,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {1018#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1018#true} is VALID [2018-11-14 16:15:58,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {1018#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,960 INFO L273 TraceCheckUtils]: 20: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(~p13~0 != 0bv32); {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:58,960 INFO L273 TraceCheckUtils]: 21: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {1019#false} is VALID [2018-11-14 16:15:58,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {1019#false} assume ~p2~0 != 0bv32; {1019#false} is VALID [2018-11-14 16:15:58,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {1019#false} assume ~lk2~0 != 1bv32; {1019#false} is VALID [2018-11-14 16:15:58,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2018-11-14 16:15:58,962 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 16:15:58,962 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:58,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:58,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:58,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:58,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:58,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:59,039 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 16:15:59,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:59,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:59,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:59,041 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-14 16:15:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:59,372 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-14 16:15:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:59,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-14 16:15:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-14 16:15:59,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-14 16:15:59,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:59,673 INFO L225 Difference]: With dead ends: 139 [2018-11-14 16:15:59,674 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 16:15:59,674 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 16:15:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 16:15:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-14 16:15:59,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:59,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-14 16:15:59,703 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-14 16:15:59,703 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-14 16:15:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:59,708 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2018-11-14 16:15:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2018-11-14 16:15:59,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:59,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:59,709 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-14 16:15:59,710 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-14 16:15:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:59,715 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2018-11-14 16:15:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2018-11-14 16:15:59,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:59,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:59,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:59,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:15:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-14 16:15:59,721 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-14 16:15:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:59,722 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-14 16:15:59,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-14 16:15:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:15:59,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:59,723 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 16:15:59,723 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:59,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-14 16:15:59,724 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:59,724 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 16:15:59,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:59,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:59,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2018-11-14 16:15:59,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-14 16:15:59,876 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #249#return; {1539#true} is VALID [2018-11-14 16:15:59,876 INFO L256 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret14 := main(); {1539#true} is VALID [2018-11-14 16:15:59,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {1539#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1539#true} is VALID [2018-11-14 16:15:59,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-14 16:15:59,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1539#true} is VALID [2018-11-14 16:15:59,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1539#true} is VALID [2018-11-14 16:15:59,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {1539#true} assume !(~p1~0 != 0bv32); {1539#true} is VALID [2018-11-14 16:15:59,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {1539#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:59,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1540#false} is VALID [2018-11-14 16:15:59,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2018-11-14 16:15:59,896 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 16:15:59,896 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:59,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:59,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:59,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:59,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:59,941 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 16:15:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:59,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:59,942 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-14 16:16:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:00,174 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-14 16:16:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:00,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-14 16:16:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-14 16:16:00,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2018-11-14 16:16:00,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:00,409 INFO L225 Difference]: With dead ends: 177 [2018-11-14 16:16:00,409 INFO L226 Difference]: Without dead ends: 175 [2018-11-14 16:16:00,410 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 16:16:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-14 16:16:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-14 16:16:00,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:00,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 123 states. [2018-11-14 16:16:00,449 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 123 states. [2018-11-14 16:16:00,449 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 123 states. [2018-11-14 16:16:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:00,457 INFO L93 Difference]: Finished difference Result 175 states and 314 transitions. [2018-11-14 16:16:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 314 transitions. [2018-11-14 16:16:00,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:00,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:00,458 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 175 states. [2018-11-14 16:16:00,458 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 175 states. [2018-11-14 16:16:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:00,467 INFO L93 Difference]: Finished difference Result 175 states and 314 transitions. [2018-11-14 16:16:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 314 transitions. [2018-11-14 16:16:00,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:00,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:00,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:00,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 16:16:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-14 16:16:00,474 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-14 16:16:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:00,474 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-14 16:16:00,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-14 16:16:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:16:00,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:00,476 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 16:16:00,476 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:00,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-14 16:16:00,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:00,477 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 16:16:00,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:00,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:00,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-14 16:16:00,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:16:00,582 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2286#true} {2286#true} #249#return; {2286#true} is VALID [2018-11-14 16:16:00,582 INFO L256 TraceCheckUtils]: 3: Hoare triple {2286#true} call #t~ret14 := main(); {2286#true} is VALID [2018-11-14 16:16:00,583 INFO L273 TraceCheckUtils]: 4: Hoare triple {2286#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {2286#true} is VALID [2018-11-14 16:16:00,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-14 16:16:00,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {2286#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {2286#true} is VALID [2018-11-14 16:16:00,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {2286#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {2286#true} is VALID [2018-11-14 16:16:00,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {2286#true} assume !(~p1~0 != 0bv32); {2286#true} is VALID [2018-11-14 16:16:00,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {2286#true} assume !(~p2~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,601 INFO L273 TraceCheckUtils]: 19: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(~p13~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:00,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {2287#false} is VALID [2018-11-14 16:16:00,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {2287#false} assume ~lk2~0 != 1bv32; {2287#false} is VALID [2018-11-14 16:16:00,604 INFO L273 TraceCheckUtils]: 24: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-14 16:16:00,605 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 16:16:00,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:00,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:00,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:00,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:00,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:00,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:00,653 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 16:16:00,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:00,654 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-14 16:16:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:01,001 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-14 16:16:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:01,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-14 16:16:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-14 16:16:01,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-14 16:16:01,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:01,593 INFO L225 Difference]: With dead ends: 291 [2018-11-14 16:16:01,593 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 16:16:01,594 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 16:16:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 16:16:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-14 16:16:01,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:01,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 175 states. [2018-11-14 16:16:01,622 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 175 states. [2018-11-14 16:16:01,623 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 175 states. [2018-11-14 16:16:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:01,629 INFO L93 Difference]: Finished difference Result 177 states and 312 transitions. [2018-11-14 16:16:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2018-11-14 16:16:01,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:01,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:01,631 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 177 states. [2018-11-14 16:16:01,631 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 177 states. [2018-11-14 16:16:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:01,638 INFO L93 Difference]: Finished difference Result 177 states and 312 transitions. [2018-11-14 16:16:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2018-11-14 16:16:01,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:01,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:01,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:01,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-14 16:16:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-14 16:16:01,646 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-14 16:16:01,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:01,646 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-14 16:16:01,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-14 16:16:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:16:01,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:01,648 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 16:16:01,648 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:01,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:01,649 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-14 16:16:01,649 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:01,649 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 16:16:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:01,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:01,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {3207#true} call ULTIMATE.init(); {3207#true} is VALID [2018-11-14 16:16:01,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {3207#true} assume true; {3207#true} is VALID [2018-11-14 16:16:01,767 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3207#true} {3207#true} #249#return; {3207#true} is VALID [2018-11-14 16:16:01,768 INFO L256 TraceCheckUtils]: 3: Hoare triple {3207#true} call #t~ret14 := main(); {3207#true} is VALID [2018-11-14 16:16:01,768 INFO L273 TraceCheckUtils]: 4: Hoare triple {3207#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {3207#true} is VALID [2018-11-14 16:16:01,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {3207#true} assume true; {3207#true} is VALID [2018-11-14 16:16:01,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {3207#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {3207#true} is VALID [2018-11-14 16:16:01,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {3207#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {3207#true} is VALID [2018-11-14 16:16:01,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {3207#true} assume !(~p1~0 != 0bv32); {3207#true} is VALID [2018-11-14 16:16:01,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {3207#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,773 INFO L273 TraceCheckUtils]: 15: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,775 INFO L273 TraceCheckUtils]: 18: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p13~0 != 0bv32); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:01,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {3208#false} is VALID [2018-11-14 16:16:01,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {3208#false} assume ~p3~0 != 0bv32; {3208#false} is VALID [2018-11-14 16:16:01,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {3208#false} assume ~lk3~0 != 1bv32; {3208#false} is VALID [2018-11-14 16:16:01,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {3208#false} assume !false; {3208#false} is VALID [2018-11-14 16:16:01,784 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 16:16:01,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:01,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:01,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:01,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:01,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:01,822 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 16:16:01,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:01,823 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-14 16:16:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:02,171 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-14 16:16:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:02,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-14 16:16:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-14 16:16:02,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-14 16:16:02,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:02,899 INFO L225 Difference]: With dead ends: 262 [2018-11-14 16:16:02,899 INFO L226 Difference]: Without dead ends: 179 [2018-11-14 16:16:02,900 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 16:16:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-14 16:16:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-14 16:16:02,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:02,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-14 16:16:02,930 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-14 16:16:02,930 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-14 16:16:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:02,938 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2018-11-14 16:16:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-11-14 16:16:02,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:02,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:02,939 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-14 16:16:02,939 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-14 16:16:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:02,946 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2018-11-14 16:16:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-11-14 16:16:02,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:02,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:02,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:02,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-14 16:16:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-14 16:16:02,955 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-14 16:16:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:02,956 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-14 16:16:02,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-14 16:16:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:16:02,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:02,957 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 16:16:02,957 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:02,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-14 16:16:02,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:02,961 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 16:16:02,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:03,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:03,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {4108#true} call ULTIMATE.init(); {4108#true} is VALID [2018-11-14 16:16:03,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {4108#true} assume true; {4108#true} is VALID [2018-11-14 16:16:03,132 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4108#true} {4108#true} #249#return; {4108#true} is VALID [2018-11-14 16:16:03,132 INFO L256 TraceCheckUtils]: 3: Hoare triple {4108#true} call #t~ret14 := main(); {4108#true} is VALID [2018-11-14 16:16:03,132 INFO L273 TraceCheckUtils]: 4: Hoare triple {4108#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {4108#true} is VALID [2018-11-14 16:16:03,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {4108#true} assume true; {4108#true} is VALID [2018-11-14 16:16:03,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {4108#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {4108#true} is VALID [2018-11-14 16:16:03,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {4108#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {4108#true} is VALID [2018-11-14 16:16:03,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {4108#true} assume !(~p1~0 != 0bv32); {4108#true} is VALID [2018-11-14 16:16:03,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {4108#true} assume !(~p2~0 != 0bv32); {4108#true} is VALID [2018-11-14 16:16:03,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {4108#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:03,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {4109#false} is VALID [2018-11-14 16:16:03,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {4109#false} assume !false; {4109#false} is VALID [2018-11-14 16:16:03,184 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 16:16:03,184 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:03,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:03,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:03,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:03,214 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 16:16:03,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:03,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:03,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:03,215 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-14 16:16:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:03,558 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-14 16:16:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:03,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-14 16:16:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-14 16:16:03,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2018-11-14 16:16:04,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:04,067 INFO L225 Difference]: With dead ends: 333 [2018-11-14 16:16:04,067 INFO L226 Difference]: Without dead ends: 331 [2018-11-14 16:16:04,068 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 16:16:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-14 16:16:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-14 16:16:04,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:04,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand 237 states. [2018-11-14 16:16:04,141 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand 237 states. [2018-11-14 16:16:04,142 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 237 states. [2018-11-14 16:16:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:04,150 INFO L93 Difference]: Finished difference Result 331 states and 588 transitions. [2018-11-14 16:16:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 588 transitions. [2018-11-14 16:16:04,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:04,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:04,151 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 331 states. [2018-11-14 16:16:04,151 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 331 states. [2018-11-14 16:16:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:04,161 INFO L93 Difference]: Finished difference Result 331 states and 588 transitions. [2018-11-14 16:16:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 588 transitions. [2018-11-14 16:16:04,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:04,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:04,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:04,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-14 16:16:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-14 16:16:04,169 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-14 16:16:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:04,169 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-14 16:16:04,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-14 16:16:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:16:04,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:04,170 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 16:16:04,171 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:04,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-14 16:16:04,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:04,172 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 16:16:04,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:04,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:04,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {5446#true} call ULTIMATE.init(); {5446#true} is VALID [2018-11-14 16:16:04,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {5446#true} assume true; {5446#true} is VALID [2018-11-14 16:16:04,638 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5446#true} {5446#true} #249#return; {5446#true} is VALID [2018-11-14 16:16:04,638 INFO L256 TraceCheckUtils]: 3: Hoare triple {5446#true} call #t~ret14 := main(); {5446#true} is VALID [2018-11-14 16:16:04,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {5446#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {5446#true} is VALID [2018-11-14 16:16:04,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {5446#true} assume true; {5446#true} is VALID [2018-11-14 16:16:04,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {5446#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {5446#true} is VALID [2018-11-14 16:16:04,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {5446#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {5446#true} is VALID [2018-11-14 16:16:04,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {5446#true} assume !(~p1~0 != 0bv32); {5446#true} is VALID [2018-11-14 16:16:04,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {5446#true} assume !(~p2~0 != 0bv32); {5446#true} is VALID [2018-11-14 16:16:04,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {5446#true} assume !(~p3~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p13~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:04,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {5447#false} is VALID [2018-11-14 16:16:04,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {5447#false} assume ~lk3~0 != 1bv32; {5447#false} is VALID [2018-11-14 16:16:04,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {5447#false} assume !false; {5447#false} is VALID [2018-11-14 16:16:04,651 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 16:16:04,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:04,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:04,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:04,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:04,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:04,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:04,682 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 16:16:04,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:04,683 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-14 16:16:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:05,184 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-14 16:16:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:05,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-14 16:16:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-14 16:16:05,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2018-11-14 16:16:05,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:05,874 INFO L225 Difference]: With dead ends: 565 [2018-11-14 16:16:05,874 INFO L226 Difference]: Without dead ends: 339 [2018-11-14 16:16:05,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 16:16:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-14 16:16:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-14 16:16:05,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:05,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand 337 states. [2018-11-14 16:16:05,956 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 337 states. [2018-11-14 16:16:05,956 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 337 states. [2018-11-14 16:16:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:05,965 INFO L93 Difference]: Finished difference Result 339 states and 588 transitions. [2018-11-14 16:16:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 588 transitions. [2018-11-14 16:16:05,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:05,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:05,967 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 339 states. [2018-11-14 16:16:05,967 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 339 states. [2018-11-14 16:16:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:05,976 INFO L93 Difference]: Finished difference Result 339 states and 588 transitions. [2018-11-14 16:16:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 588 transitions. [2018-11-14 16:16:05,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:05,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:05,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:05,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-14 16:16:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-14 16:16:05,988 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-14 16:16:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:05,988 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-14 16:16:05,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-14 16:16:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:16:05,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:05,989 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 16:16:05,990 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:05,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-14 16:16:05,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:05,990 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 16:16:06,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:06,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:06,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {7140#true} call ULTIMATE.init(); {7140#true} is VALID [2018-11-14 16:16:06,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {7140#true} assume true; {7140#true} is VALID [2018-11-14 16:16:06,491 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7140#true} {7140#true} #249#return; {7140#true} is VALID [2018-11-14 16:16:06,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {7140#true} call #t~ret14 := main(); {7140#true} is VALID [2018-11-14 16:16:06,491 INFO L273 TraceCheckUtils]: 4: Hoare triple {7140#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {7140#true} is VALID [2018-11-14 16:16:06,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {7140#true} assume true; {7140#true} is VALID [2018-11-14 16:16:06,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {7140#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {7140#true} is VALID [2018-11-14 16:16:06,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {7140#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {7140#true} is VALID [2018-11-14 16:16:06,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {7140#true} assume !(~p1~0 != 0bv32); {7140#true} is VALID [2018-11-14 16:16:06,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {7140#true} assume !(~p2~0 != 0bv32); {7140#true} is VALID [2018-11-14 16:16:06,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {7140#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p13~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:06,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {7141#false} is VALID [2018-11-14 16:16:06,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {7141#false} assume ~p4~0 != 0bv32; {7141#false} is VALID [2018-11-14 16:16:06,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {7141#false} assume ~lk4~0 != 1bv32; {7141#false} is VALID [2018-11-14 16:16:06,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {7141#false} assume !false; {7141#false} is VALID [2018-11-14 16:16:06,511 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 16:16:06,511 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:06,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:06,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:06,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:06,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:06,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:06,538 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 16:16:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:06,539 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-14 16:16:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:06,953 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-14 16:16:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:06,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 16:16:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 16:16:06,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-14 16:16:07,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:07,645 INFO L225 Difference]: With dead ends: 505 [2018-11-14 16:16:07,646 INFO L226 Difference]: Without dead ends: 343 [2018-11-14 16:16:07,647 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 16:16:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-14 16:16:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-14 16:16:07,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:07,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand 341 states. [2018-11-14 16:16:07,822 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 341 states. [2018-11-14 16:16:07,822 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 341 states. [2018-11-14 16:16:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:07,835 INFO L93 Difference]: Finished difference Result 343 states and 588 transitions. [2018-11-14 16:16:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 588 transitions. [2018-11-14 16:16:07,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:07,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:07,838 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand 343 states. [2018-11-14 16:16:07,838 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 343 states. [2018-11-14 16:16:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:07,849 INFO L93 Difference]: Finished difference Result 343 states and 588 transitions. [2018-11-14 16:16:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 588 transitions. [2018-11-14 16:16:07,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:07,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:07,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:07,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-14 16:16:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-14 16:16:07,862 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-14 16:16:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:07,863 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-14 16:16:07,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-14 16:16:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:16:07,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:07,864 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 16:16:07,864 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:07,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-14 16:16:07,865 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:07,865 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 16:16:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:07,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:08,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {8789#true} call ULTIMATE.init(); {8789#true} is VALID [2018-11-14 16:16:08,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {8789#true} assume true; {8789#true} is VALID [2018-11-14 16:16:08,367 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8789#true} {8789#true} #249#return; {8789#true} is VALID [2018-11-14 16:16:08,367 INFO L256 TraceCheckUtils]: 3: Hoare triple {8789#true} call #t~ret14 := main(); {8789#true} is VALID [2018-11-14 16:16:08,367 INFO L273 TraceCheckUtils]: 4: Hoare triple {8789#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {8789#true} is VALID [2018-11-14 16:16:08,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {8789#true} assume true; {8789#true} is VALID [2018-11-14 16:16:08,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {8789#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {8789#true} is VALID [2018-11-14 16:16:08,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {8789#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {8789#true} is VALID [2018-11-14 16:16:08,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {8789#true} assume !(~p1~0 != 0bv32); {8789#true} is VALID [2018-11-14 16:16:08,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {8789#true} assume !(~p2~0 != 0bv32); {8789#true} is VALID [2018-11-14 16:16:08,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {8789#true} assume !(~p3~0 != 0bv32); {8789#true} is VALID [2018-11-14 16:16:08,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {8789#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,376 INFO L273 TraceCheckUtils]: 23: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:08,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {8790#false} is VALID [2018-11-14 16:16:08,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {8790#false} assume !false; {8790#false} is VALID [2018-11-14 16:16:08,380 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 16:16:08,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:08,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:08,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:08,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:08,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:08,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:08,436 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 16:16:08,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:08,437 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-14 16:16:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:09,346 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-14 16:16:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:09,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-14 16:16:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-14 16:16:09,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2018-11-14 16:16:09,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:09,531 INFO L225 Difference]: With dead ends: 637 [2018-11-14 16:16:09,531 INFO L226 Difference]: Without dead ends: 635 [2018-11-14 16:16:09,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 16:16:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-14 16:16:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-14 16:16:09,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:09,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand 465 states. [2018-11-14 16:16:09,653 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand 465 states. [2018-11-14 16:16:09,653 INFO L87 Difference]: Start difference. First operand 635 states. Second operand 465 states. [2018-11-14 16:16:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:09,676 INFO L93 Difference]: Finished difference Result 635 states and 1104 transitions. [2018-11-14 16:16:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1104 transitions. [2018-11-14 16:16:09,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:09,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:09,678 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand 635 states. [2018-11-14 16:16:09,678 INFO L87 Difference]: Start difference. First operand 465 states. Second operand 635 states. [2018-11-14 16:16:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:09,701 INFO L93 Difference]: Finished difference Result 635 states and 1104 transitions. [2018-11-14 16:16:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1104 transitions. [2018-11-14 16:16:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:09,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:09,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:09,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-14 16:16:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-14 16:16:09,717 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-14 16:16:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:09,718 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-14 16:16:09,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-14 16:16:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:16:09,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:09,719 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 16:16:09,719 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:09,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-14 16:16:09,720 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:09,720 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 16:16:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:09,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:09,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {11282#true} call ULTIMATE.init(); {11282#true} is VALID [2018-11-14 16:16:09,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {11282#true} assume true; {11282#true} is VALID [2018-11-14 16:16:09,861 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11282#true} {11282#true} #249#return; {11282#true} is VALID [2018-11-14 16:16:09,861 INFO L256 TraceCheckUtils]: 3: Hoare triple {11282#true} call #t~ret14 := main(); {11282#true} is VALID [2018-11-14 16:16:09,862 INFO L273 TraceCheckUtils]: 4: Hoare triple {11282#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {11282#true} is VALID [2018-11-14 16:16:09,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {11282#true} assume true; {11282#true} is VALID [2018-11-14 16:16:09,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {11282#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {11282#true} is VALID [2018-11-14 16:16:09,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {11282#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {11282#true} is VALID [2018-11-14 16:16:09,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {11282#true} assume !(~p1~0 != 0bv32); {11282#true} is VALID [2018-11-14 16:16:09,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {11282#true} assume !(~p2~0 != 0bv32); {11282#true} is VALID [2018-11-14 16:16:09,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {11282#true} assume !(~p3~0 != 0bv32); {11282#true} is VALID [2018-11-14 16:16:09,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {11282#true} assume !(~p4~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p13~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:09,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {11283#false} is VALID [2018-11-14 16:16:09,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {11283#false} assume ~lk4~0 != 1bv32; {11283#false} is VALID [2018-11-14 16:16:09,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {11283#false} assume !false; {11283#false} is VALID [2018-11-14 16:16:09,876 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 16:16:09,876 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:09,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:09,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:09,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:09,908 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 16:16:09,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:09,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:09,909 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-14 16:16:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:10,253 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-14 16:16:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:10,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-14 16:16:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-14 16:16:10,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2018-11-14 16:16:10,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:10,525 INFO L225 Difference]: With dead ends: 1109 [2018-11-14 16:16:10,526 INFO L226 Difference]: Without dead ends: 659 [2018-11-14 16:16:10,527 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 16:16:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-14 16:16:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-14 16:16:10,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:10,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand 657 states. [2018-11-14 16:16:10,763 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand 657 states. [2018-11-14 16:16:10,763 INFO L87 Difference]: Start difference. First operand 659 states. Second operand 657 states. [2018-11-14 16:16:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:10,782 INFO L93 Difference]: Finished difference Result 659 states and 1112 transitions. [2018-11-14 16:16:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1112 transitions. [2018-11-14 16:16:10,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:10,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:10,784 INFO L74 IsIncluded]: Start isIncluded. First operand 657 states. Second operand 659 states. [2018-11-14 16:16:10,784 INFO L87 Difference]: Start difference. First operand 657 states. Second operand 659 states. [2018-11-14 16:16:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:10,809 INFO L93 Difference]: Finished difference Result 659 states and 1112 transitions. [2018-11-14 16:16:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1112 transitions. [2018-11-14 16:16:10,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:10,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:10,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:10,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-14 16:16:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-14 16:16:10,837 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-14 16:16:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:10,837 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-14 16:16:10,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-14 16:16:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:16:10,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:10,839 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 16:16:10,839 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:10,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-14 16:16:10,840 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:10,840 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 16:16:10,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:10,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:10,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {14503#true} call ULTIMATE.init(); {14503#true} is VALID [2018-11-14 16:16:10,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {14503#true} assume true; {14503#true} is VALID [2018-11-14 16:16:10,974 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14503#true} {14503#true} #249#return; {14503#true} is VALID [2018-11-14 16:16:10,974 INFO L256 TraceCheckUtils]: 3: Hoare triple {14503#true} call #t~ret14 := main(); {14503#true} is VALID [2018-11-14 16:16:10,974 INFO L273 TraceCheckUtils]: 4: Hoare triple {14503#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {14503#true} is VALID [2018-11-14 16:16:10,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {14503#true} assume true; {14503#true} is VALID [2018-11-14 16:16:10,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {14503#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {14503#true} is VALID [2018-11-14 16:16:10,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {14503#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {14503#true} is VALID [2018-11-14 16:16:10,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {14503#true} assume !(~p1~0 != 0bv32); {14503#true} is VALID [2018-11-14 16:16:10,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {14503#true} assume !(~p2~0 != 0bv32); {14503#true} is VALID [2018-11-14 16:16:10,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {14503#true} assume !(~p3~0 != 0bv32); {14503#true} is VALID [2018-11-14 16:16:10,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {14503#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,980 INFO L273 TraceCheckUtils]: 15: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p13~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,983 INFO L273 TraceCheckUtils]: 21: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:10,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {14504#false} is VALID [2018-11-14 16:16:10,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {14504#false} assume ~p5~0 != 0bv32; {14504#false} is VALID [2018-11-14 16:16:10,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {14504#false} assume ~lk5~0 != 1bv32; {14504#false} is VALID [2018-11-14 16:16:10,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {14504#false} assume !false; {14504#false} is VALID [2018-11-14 16:16:10,988 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 16:16:10,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:10,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:10,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:10,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:10,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:10,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:11,021 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 16:16:11,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:11,023 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-14 16:16:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:11,457 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-14 16:16:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:11,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-14 16:16:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-14 16:16:11,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2018-11-14 16:16:11,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:11,723 INFO L225 Difference]: With dead ends: 985 [2018-11-14 16:16:11,723 INFO L226 Difference]: Without dead ends: 667 [2018-11-14 16:16:11,724 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 16:16:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-14 16:16:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-14 16:16:11,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:11,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand 665 states. [2018-11-14 16:16:11,927 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand 665 states. [2018-11-14 16:16:11,928 INFO L87 Difference]: Start difference. First operand 667 states. Second operand 665 states. [2018-11-14 16:16:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:11,947 INFO L93 Difference]: Finished difference Result 667 states and 1112 transitions. [2018-11-14 16:16:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1112 transitions. [2018-11-14 16:16:11,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:11,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:11,948 INFO L74 IsIncluded]: Start isIncluded. First operand 665 states. Second operand 667 states. [2018-11-14 16:16:11,948 INFO L87 Difference]: Start difference. First operand 665 states. Second operand 667 states. [2018-11-14 16:16:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:11,972 INFO L93 Difference]: Finished difference Result 667 states and 1112 transitions. [2018-11-14 16:16:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1112 transitions. [2018-11-14 16:16:11,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:11,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:11,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:11,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-14 16:16:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-14 16:16:11,997 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-14 16:16:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:11,998 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-14 16:16:11,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-14 16:16:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:16:11,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:11,999 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 16:16:11,999 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:11,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:12,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-14 16:16:12,000 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:12,000 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 16:16:12,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:12,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:12,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {17627#true} call ULTIMATE.init(); {17627#true} is VALID [2018-11-14 16:16:12,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {17627#true} assume true; {17627#true} is VALID [2018-11-14 16:16:12,097 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17627#true} {17627#true} #249#return; {17627#true} is VALID [2018-11-14 16:16:12,097 INFO L256 TraceCheckUtils]: 3: Hoare triple {17627#true} call #t~ret14 := main(); {17627#true} is VALID [2018-11-14 16:16:12,097 INFO L273 TraceCheckUtils]: 4: Hoare triple {17627#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {17627#true} is VALID [2018-11-14 16:16:12,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {17627#true} assume true; {17627#true} is VALID [2018-11-14 16:16:12,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {17627#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {17627#true} is VALID [2018-11-14 16:16:12,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {17627#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {17627#true} is VALID [2018-11-14 16:16:12,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {17627#true} assume !(~p1~0 != 0bv32); {17627#true} is VALID [2018-11-14 16:16:12,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {17627#true} assume !(~p2~0 != 0bv32); {17627#true} is VALID [2018-11-14 16:16:12,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {17627#true} assume !(~p3~0 != 0bv32); {17627#true} is VALID [2018-11-14 16:16:12,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {17627#true} assume !(~p4~0 != 0bv32); {17627#true} is VALID [2018-11-14 16:16:12,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {17627#true} assume !(~p5~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p13~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:12,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {17628#false} is VALID [2018-11-14 16:16:12,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {17628#false} assume ~lk5~0 != 1bv32; {17628#false} is VALID [2018-11-14 16:16:12,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {17628#false} assume !false; {17628#false} is VALID [2018-11-14 16:16:12,117 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 16:16:12,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:12,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:12,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:12,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:12,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:12,147 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 16:16:12,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:12,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:12,148 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-14 16:16:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:13,158 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-14 16:16:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:13,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 16:16:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-14 16:16:13,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-14 16:16:13,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:13,477 INFO L225 Difference]: With dead ends: 1933 [2018-11-14 16:16:13,477 INFO L226 Difference]: Without dead ends: 1291 [2018-11-14 16:16:13,478 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 16:16:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-14 16:16:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-14 16:16:14,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:14,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand 1289 states. [2018-11-14 16:16:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand 1289 states. [2018-11-14 16:16:14,033 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand 1289 states. [2018-11-14 16:16:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:14,089 INFO L93 Difference]: Finished difference Result 1291 states and 2120 transitions. [2018-11-14 16:16:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2120 transitions. [2018-11-14 16:16:14,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:14,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:14,092 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand 1291 states. [2018-11-14 16:16:14,092 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand 1291 states. [2018-11-14 16:16:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:14,143 INFO L93 Difference]: Finished difference Result 1291 states and 2120 transitions. [2018-11-14 16:16:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2120 transitions. [2018-11-14 16:16:14,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:14,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:14,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:14,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-14 16:16:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-14 16:16:14,195 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-14 16:16:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:14,196 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-14 16:16:14,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-14 16:16:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:16:14,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:14,197 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 16:16:14,197 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:14,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-14 16:16:14,198 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:14,198 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 16:16:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:14,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:14,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {23611#true} call ULTIMATE.init(); {23611#true} is VALID [2018-11-14 16:16:14,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {23611#true} assume true; {23611#true} is VALID [2018-11-14 16:16:14,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23611#true} {23611#true} #249#return; {23611#true} is VALID [2018-11-14 16:16:14,356 INFO L256 TraceCheckUtils]: 3: Hoare triple {23611#true} call #t~ret14 := main(); {23611#true} is VALID [2018-11-14 16:16:14,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {23611#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {23611#true} is VALID [2018-11-14 16:16:14,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {23611#true} assume true; {23611#true} is VALID [2018-11-14 16:16:14,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {23611#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {23611#true} is VALID [2018-11-14 16:16:14,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {23611#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {23611#true} is VALID [2018-11-14 16:16:14,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {23611#true} assume !(~p1~0 != 0bv32); {23611#true} is VALID [2018-11-14 16:16:14,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {23611#true} assume !(~p2~0 != 0bv32); {23611#true} is VALID [2018-11-14 16:16:14,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {23611#true} assume !(~p3~0 != 0bv32); {23611#true} is VALID [2018-11-14 16:16:14,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {23611#true} assume !(~p4~0 != 0bv32); {23611#true} is VALID [2018-11-14 16:16:14,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {23611#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {23612#false} is VALID [2018-11-14 16:16:14,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {23612#false} assume !false; {23612#false} is VALID [2018-11-14 16:16:14,364 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 16:16:14,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:14,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:14,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:14,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:14,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:14,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:14,393 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 16:16:14,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:14,394 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-14 16:16:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,017 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-14 16:16:15,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:15,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-14 16:16:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-14 16:16:15,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-14 16:16:15,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:15,287 INFO L225 Difference]: With dead ends: 1597 [2018-11-14 16:16:15,287 INFO L226 Difference]: Without dead ends: 1595 [2018-11-14 16:16:15,288 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 16:16:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-14 16:16:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-14 16:16:16,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:16,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1595 states. Second operand 1289 states. [2018-11-14 16:16:16,135 INFO L74 IsIncluded]: Start isIncluded. First operand 1595 states. Second operand 1289 states. [2018-11-14 16:16:16,136 INFO L87 Difference]: Start difference. First operand 1595 states. Second operand 1289 states. [2018-11-14 16:16:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,225 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2018-11-14 16:16:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2664 transitions. [2018-11-14 16:16:16,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:16,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:16,227 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand 1595 states. [2018-11-14 16:16:16,227 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand 1595 states. [2018-11-14 16:16:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,324 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2018-11-14 16:16:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2664 transitions. [2018-11-14 16:16:16,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:16,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:16,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:16,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-14 16:16:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-14 16:16:16,381 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-14 16:16:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:16,381 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-14 16:16:16,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-14 16:16:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:16:16,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:16,382 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 16:16:16,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:16,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-14 16:16:16,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:16,383 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 16:16:16,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:16,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:16,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {29867#true} call ULTIMATE.init(); {29867#true} is VALID [2018-11-14 16:16:16,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {29867#true} assume true; {29867#true} is VALID [2018-11-14 16:16:16,717 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29867#true} {29867#true} #249#return; {29867#true} is VALID [2018-11-14 16:16:16,717 INFO L256 TraceCheckUtils]: 3: Hoare triple {29867#true} call #t~ret14 := main(); {29867#true} is VALID [2018-11-14 16:16:16,717 INFO L273 TraceCheckUtils]: 4: Hoare triple {29867#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {29867#true} is VALID [2018-11-14 16:16:16,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {29867#true} assume true; {29867#true} is VALID [2018-11-14 16:16:16,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {29867#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {29867#true} is VALID [2018-11-14 16:16:16,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {29867#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {29867#true} is VALID [2018-11-14 16:16:16,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {29867#true} assume !(~p1~0 != 0bv32); {29867#true} is VALID [2018-11-14 16:16:16,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {29867#true} assume !(~p2~0 != 0bv32); {29867#true} is VALID [2018-11-14 16:16:16,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {29867#true} assume !(~p3~0 != 0bv32); {29867#true} is VALID [2018-11-14 16:16:16,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {29867#true} assume !(~p4~0 != 0bv32); {29867#true} is VALID [2018-11-14 16:16:16,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {29867#true} assume !(~p5~0 != 0bv32); {29867#true} is VALID [2018-11-14 16:16:16,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {29867#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,770 INFO L273 TraceCheckUtils]: 26: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,770 INFO L273 TraceCheckUtils]: 27: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {29868#false} is VALID [2018-11-14 16:16:16,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {29868#false} assume !false; {29868#false} is VALID [2018-11-14 16:16:16,771 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 16:16:16,771 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:16,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:16,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:16,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:16:16,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:16,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:16,801 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 16:16:16,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:16,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:16,802 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-14 16:16:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:17,776 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-14 16:16:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:17,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:16:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 16:16:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-14 16:16:17,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2018-11-14 16:16:17,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:18,179 INFO L225 Difference]: With dead ends: 2365 [2018-11-14 16:16:18,179 INFO L226 Difference]: Without dead ends: 2363 [2018-11-14 16:16:18,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-14 16:16:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-14 16:16:18,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:18,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2363 states. Second operand 1817 states. [2018-11-14 16:16:18,708 INFO L74 IsIncluded]: Start isIncluded. First operand 2363 states. Second operand 1817 states. [2018-11-14 16:16:18,708 INFO L87 Difference]: Start difference. First operand 2363 states. Second operand 1817 states. [2018-11-14 16:16:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:18,875 INFO L93 Difference]: Finished difference Result 2363 states and 3896 transitions. [2018-11-14 16:16:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3896 transitions. [2018-11-14 16:16:18,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:18,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:18,878 INFO L74 IsIncluded]: Start isIncluded. First operand 1817 states. Second operand 2363 states. [2018-11-14 16:16:18,878 INFO L87 Difference]: Start difference. First operand 1817 states. Second operand 2363 states. [2018-11-14 16:16:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:19,059 INFO L93 Difference]: Finished difference Result 2363 states and 3896 transitions. [2018-11-14 16:16:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3896 transitions. [2018-11-14 16:16:19,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:19,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:19,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:19,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-14 16:16:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-14 16:16:19,164 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-14 16:16:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:19,164 INFO L480 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-14 16:16:19,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-14 16:16:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:16:19,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:19,166 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 16:16:19,166 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:19,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-14 16:16:19,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:19,167 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 16:16:19,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:19,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:19,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {38974#true} call ULTIMATE.init(); {38974#true} is VALID [2018-11-14 16:16:19,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {38974#true} assume true; {38974#true} is VALID [2018-11-14 16:16:19,265 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38974#true} {38974#true} #249#return; {38974#true} is VALID [2018-11-14 16:16:19,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {38974#true} call #t~ret14 := main(); {38974#true} is VALID [2018-11-14 16:16:19,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {38974#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {38974#true} is VALID [2018-11-14 16:16:19,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {38974#true} assume true; {38974#true} is VALID [2018-11-14 16:16:19,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {38974#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {38974#true} is VALID [2018-11-14 16:16:19,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {38974#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {38974#true} is VALID [2018-11-14 16:16:19,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {38974#true} assume !(~p1~0 != 0bv32); {38974#true} is VALID [2018-11-14 16:16:19,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {38974#true} assume !(~p2~0 != 0bv32); {38974#true} is VALID [2018-11-14 16:16:19,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {38974#true} assume !(~p3~0 != 0bv32); {38974#true} is VALID [2018-11-14 16:16:19,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {38974#true} assume !(~p4~0 != 0bv32); {38974#true} is VALID [2018-11-14 16:16:19,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {38974#true} assume !(~p5~0 != 0bv32); {38974#true} is VALID [2018-11-14 16:16:19,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {38974#true} assume !(~p6~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p13~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:19,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {38975#false} is VALID [2018-11-14 16:16:19,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {38975#false} assume ~lk6~0 != 1bv32; {38975#false} is VALID [2018-11-14 16:16:19,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {38975#false} assume !false; {38975#false} is VALID [2018-11-14 16:16:19,273 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 16:16:19,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:19,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:19,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:16:19,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:19,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:19,305 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 16:16:19,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:19,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:19,306 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-14 16:16:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:20,994 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-14 16:16:20,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:20,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:16:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-14 16:16:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-14 16:16:20,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2018-11-14 16:16:21,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:21,466 INFO L225 Difference]: With dead ends: 4317 [2018-11-14 16:16:21,466 INFO L226 Difference]: Without dead ends: 2523 [2018-11-14 16:16:21,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-14 16:16:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-14 16:16:22,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:22,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2523 states. Second operand 2521 states. [2018-11-14 16:16:22,015 INFO L74 IsIncluded]: Start isIncluded. First operand 2523 states. Second operand 2521 states. [2018-11-14 16:16:22,015 INFO L87 Difference]: Start difference. First operand 2523 states. Second operand 2521 states. [2018-11-14 16:16:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:22,253 INFO L93 Difference]: Finished difference Result 2523 states and 4008 transitions. [2018-11-14 16:16:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4008 transitions. [2018-11-14 16:16:22,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:22,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:22,256 INFO L74 IsIncluded]: Start isIncluded. First operand 2521 states. Second operand 2523 states. [2018-11-14 16:16:22,256 INFO L87 Difference]: Start difference. First operand 2521 states. Second operand 2523 states. [2018-11-14 16:16:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:22,433 INFO L93 Difference]: Finished difference Result 2523 states and 4008 transitions. [2018-11-14 16:16:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4008 transitions. [2018-11-14 16:16:22,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:22,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:22,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:22,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-14 16:16:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-14 16:16:22,651 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-14 16:16:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:22,652 INFO L480 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-14 16:16:22,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-14 16:16:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:16:22,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:22,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:22,654 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-14 16:16:22,654 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:22,654 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 16:16:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:22,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:22,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {51121#true} call ULTIMATE.init(); {51121#true} is VALID [2018-11-14 16:16:22,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {51121#true} assume true; {51121#true} is VALID [2018-11-14 16:16:22,825 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {51121#true} {51121#true} #249#return; {51121#true} is VALID [2018-11-14 16:16:22,825 INFO L256 TraceCheckUtils]: 3: Hoare triple {51121#true} call #t~ret14 := main(); {51121#true} is VALID [2018-11-14 16:16:22,825 INFO L273 TraceCheckUtils]: 4: Hoare triple {51121#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {51121#true} assume true; {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {51121#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {51121#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {51121#true} assume !(~p1~0 != 0bv32); {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {51121#true} assume !(~p2~0 != 0bv32); {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {51121#true} assume !(~p3~0 != 0bv32); {51121#true} is VALID [2018-11-14 16:16:22,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {51121#true} assume !(~p4~0 != 0bv32); {51121#true} is VALID [2018-11-14 16:16:22,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {51121#true} assume !(~p5~0 != 0bv32); {51121#true} is VALID [2018-11-14 16:16:22,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {51121#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p13~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,841 INFO L273 TraceCheckUtils]: 23: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:22,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {51122#false} is VALID [2018-11-14 16:16:22,846 INFO L273 TraceCheckUtils]: 27: Hoare triple {51122#false} assume ~p7~0 != 0bv32; {51122#false} is VALID [2018-11-14 16:16:22,846 INFO L273 TraceCheckUtils]: 28: Hoare triple {51122#false} assume ~lk7~0 != 1bv32; {51122#false} is VALID [2018-11-14 16:16:22,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {51122#false} assume !false; {51122#false} is VALID [2018-11-14 16:16:22,847 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 16:16:22,847 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:22,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:22,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:16:22,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:22,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:22,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:22,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:22,896 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-14 16:16:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:24,228 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-14 16:16:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:24,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:16:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-14 16:16:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-14 16:16:24,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 228 transitions. [2018-11-14 16:16:24,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:24,752 INFO L225 Difference]: With dead ends: 3805 [2018-11-14 16:16:24,752 INFO L226 Difference]: Without dead ends: 2571 [2018-11-14 16:16:24,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-14 16:16:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-14 16:16:25,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:25,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand 2569 states. [2018-11-14 16:16:25,772 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand 2569 states. [2018-11-14 16:16:25,772 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand 2569 states. [2018-11-14 16:16:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:25,960 INFO L93 Difference]: Finished difference Result 2571 states and 4040 transitions. [2018-11-14 16:16:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4040 transitions. [2018-11-14 16:16:25,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:25,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:25,963 INFO L74 IsIncluded]: Start isIncluded. First operand 2569 states. Second operand 2571 states. [2018-11-14 16:16:25,963 INFO L87 Difference]: Start difference. First operand 2569 states. Second operand 2571 states. [2018-11-14 16:16:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:26,142 INFO L93 Difference]: Finished difference Result 2571 states and 4040 transitions. [2018-11-14 16:16:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4040 transitions. [2018-11-14 16:16:26,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:26,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:26,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:26,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-14 16:16:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-14 16:16:26,341 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-14 16:16:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:26,341 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-14 16:16:26,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-14 16:16:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:16:26,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:26,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:26,343 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:26,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-14 16:16:26,343 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:26,343 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 16:16:26,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:26,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:26,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {62903#true} call ULTIMATE.init(); {62903#true} is VALID [2018-11-14 16:16:26,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {62903#true} assume true; {62903#true} is VALID [2018-11-14 16:16:26,445 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {62903#true} {62903#true} #249#return; {62903#true} is VALID [2018-11-14 16:16:26,445 INFO L256 TraceCheckUtils]: 3: Hoare triple {62903#true} call #t~ret14 := main(); {62903#true} is VALID [2018-11-14 16:16:26,445 INFO L273 TraceCheckUtils]: 4: Hoare triple {62903#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {62903#true} is VALID [2018-11-14 16:16:26,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {62903#true} assume true; {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {62903#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {62903#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {62903#true} assume !(~p1~0 != 0bv32); {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {62903#true} assume !(~p2~0 != 0bv32); {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {62903#true} assume !(~p3~0 != 0bv32); {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {62903#true} assume !(~p4~0 != 0bv32); {62903#true} is VALID [2018-11-14 16:16:26,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {62903#true} assume !(~p5~0 != 0bv32); {62903#true} is VALID [2018-11-14 16:16:26,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {62903#true} assume !(~p6~0 != 0bv32); {62903#true} is VALID [2018-11-14 16:16:26,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {62903#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,451 INFO L273 TraceCheckUtils]: 25: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:26,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {62904#false} is VALID [2018-11-14 16:16:26,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {62904#false} assume !false; {62904#false} is VALID [2018-11-14 16:16: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 16:16:26,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:26,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:26,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:16:26,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:26,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:26,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:26,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:26,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:26,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:26,487 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-14 16:16:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:29,202 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-14 16:16:29,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:29,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:16:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 16:16:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 16:16:29,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-14 16:16:29,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:30,369 INFO L225 Difference]: With dead ends: 4621 [2018-11-14 16:16:30,370 INFO L226 Difference]: Without dead ends: 4619 [2018-11-14 16:16:30,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-14 16:16:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-14 16:16:31,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:31,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4619 states. Second operand 3657 states. [2018-11-14 16:16:31,023 INFO L74 IsIncluded]: Start isIncluded. First operand 4619 states. Second operand 3657 states. [2018-11-14 16:16:31,023 INFO L87 Difference]: Start difference. First operand 4619 states. Second operand 3657 states. [2018-11-14 16:16:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:31,814 INFO L93 Difference]: Finished difference Result 4619 states and 7336 transitions. [2018-11-14 16:16:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 7336 transitions. [2018-11-14 16:16:31,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:31,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:31,819 INFO L74 IsIncluded]: Start isIncluded. First operand 3657 states. Second operand 4619 states. [2018-11-14 16:16:31,820 INFO L87 Difference]: Start difference. First operand 3657 states. Second operand 4619 states. [2018-11-14 16:16:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:32,613 INFO L93 Difference]: Finished difference Result 4619 states and 7336 transitions. [2018-11-14 16:16:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 7336 transitions. [2018-11-14 16:16:32,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:32,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:32,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:32,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-14 16:16:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-14 16:16:33,160 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-14 16:16:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:33,161 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-14 16:16:33,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-14 16:16:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:16:33,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:33,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:33,164 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:33,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:33,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-14 16:16:33,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:33,164 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 16:16:33,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:33,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:33,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {80717#true} call ULTIMATE.init(); {80717#true} is VALID [2018-11-14 16:16:33,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {80717#true} assume true; {80717#true} is VALID [2018-11-14 16:16:33,280 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {80717#true} {80717#true} #249#return; {80717#true} is VALID [2018-11-14 16:16:33,280 INFO L256 TraceCheckUtils]: 3: Hoare triple {80717#true} call #t~ret14 := main(); {80717#true} is VALID [2018-11-14 16:16:33,280 INFO L273 TraceCheckUtils]: 4: Hoare triple {80717#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {80717#true} assume true; {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {80717#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {80717#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {80717#true} assume !(~p1~0 != 0bv32); {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {80717#true} assume !(~p2~0 != 0bv32); {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {80717#true} assume !(~p3~0 != 0bv32); {80717#true} is VALID [2018-11-14 16:16:33,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {80717#true} assume !(~p4~0 != 0bv32); {80717#true} is VALID [2018-11-14 16:16:33,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {80717#true} assume !(~p5~0 != 0bv32); {80717#true} is VALID [2018-11-14 16:16:33,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {80717#true} assume !(~p6~0 != 0bv32); {80717#true} is VALID [2018-11-14 16:16:33,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {80717#true} assume !(~p7~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p13~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,296 INFO L273 TraceCheckUtils]: 23: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:33,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {80718#false} is VALID [2018-11-14 16:16:33,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {80718#false} assume ~lk7~0 != 1bv32; {80718#false} is VALID [2018-11-14 16:16:33,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {80718#false} assume !false; {80718#false} is VALID [2018-11-14 16:16:33,301 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 16:16:33,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:33,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:33,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:33,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:16:33,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:33,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:33,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:33,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:33,357 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-14 16:16:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:37,338 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-14 16:16:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:37,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 16:16:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-14 16:16:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-14 16:16:37,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2018-11-14 16:16:37,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:38,746 INFO L225 Difference]: With dead ends: 8589 [2018-11-14 16:16:38,746 INFO L226 Difference]: Without dead ends: 5003 [2018-11-14 16:16:38,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-14 16:16:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-14 16:16:40,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:40,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5003 states. Second operand 5001 states. [2018-11-14 16:16:40,249 INFO L74 IsIncluded]: Start isIncluded. First operand 5003 states. Second operand 5001 states. [2018-11-14 16:16:40,249 INFO L87 Difference]: Start difference. First operand 5003 states. Second operand 5001 states. [2018-11-14 16:16:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:41,162 INFO L93 Difference]: Finished difference Result 5003 states and 7624 transitions. [2018-11-14 16:16:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7624 transitions. [2018-11-14 16:16:41,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:41,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:41,168 INFO L74 IsIncluded]: Start isIncluded. First operand 5001 states. Second operand 5003 states. [2018-11-14 16:16:41,168 INFO L87 Difference]: Start difference. First operand 5001 states. Second operand 5003 states. [2018-11-14 16:16:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:42,106 INFO L93 Difference]: Finished difference Result 5003 states and 7624 transitions. [2018-11-14 16:16:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7624 transitions. [2018-11-14 16:16:42,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:42,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:42,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:42,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-14 16:16:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-14 16:16:43,140 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-14 16:16:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:43,140 INFO L480 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-14 16:16:43,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-14 16:16:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:16:43,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:43,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:43,144 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:43,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-14 16:16:43,144 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:43,144 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 16:16:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:43,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:43,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {104739#true} call ULTIMATE.init(); {104739#true} is VALID [2018-11-14 16:16:43,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {104739#true} assume true; {104739#true} is VALID [2018-11-14 16:16:43,295 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {104739#true} {104739#true} #249#return; {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L256 TraceCheckUtils]: 3: Hoare triple {104739#true} call #t~ret14 := main(); {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 4: Hoare triple {104739#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {104739#true} assume true; {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {104739#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {104739#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {104739#true} assume !(~p1~0 != 0bv32); {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {104739#true} assume !(~p2~0 != 0bv32); {104739#true} is VALID [2018-11-14 16:16:43,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {104739#true} assume !(~p3~0 != 0bv32); {104739#true} is VALID [2018-11-14 16:16:43,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {104739#true} assume !(~p4~0 != 0bv32); {104739#true} is VALID [2018-11-14 16:16:43,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {104739#true} assume !(~p5~0 != 0bv32); {104739#true} is VALID [2018-11-14 16:16:43,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {104739#true} assume !(~p6~0 != 0bv32); {104739#true} is VALID [2018-11-14 16:16:43,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {104739#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p13~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,308 INFO L273 TraceCheckUtils]: 24: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:43,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {104740#false} is VALID [2018-11-14 16:16:43,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {104740#false} assume ~p8~0 != 0bv32; {104740#false} is VALID [2018-11-14 16:16:43,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {104740#false} assume ~lk8~0 != 1bv32; {104740#false} is VALID [2018-11-14 16:16:43,313 INFO L273 TraceCheckUtils]: 30: Hoare triple {104740#false} assume !false; {104740#false} is VALID [2018-11-14 16:16:43,314 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 16:16:43,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:43,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:43,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:43,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 16:16:43,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:43,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:43,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:43,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:43,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:43,357 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-14 16:16:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:47,516 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-14 16:16:47,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:47,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 16:16:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-14 16:16:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-14 16:16:47,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-14 16:16:47,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:48,683 INFO L225 Difference]: With dead ends: 7501 [2018-11-14 16:16:48,684 INFO L226 Difference]: Without dead ends: 5067 [2018-11-14 16:16:48,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-14 16:16:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-14 16:16:49,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:49,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5067 states. Second operand 5065 states. [2018-11-14 16:16:49,698 INFO L74 IsIncluded]: Start isIncluded. First operand 5067 states. Second operand 5065 states. [2018-11-14 16:16:49,698 INFO L87 Difference]: Start difference. First operand 5067 states. Second operand 5065 states. [2018-11-14 16:16:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:50,636 INFO L93 Difference]: Finished difference Result 5067 states and 7624 transitions. [2018-11-14 16:16:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7624 transitions. [2018-11-14 16:16:50,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:50,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:50,642 INFO L74 IsIncluded]: Start isIncluded. First operand 5065 states. Second operand 5067 states. [2018-11-14 16:16:50,642 INFO L87 Difference]: Start difference. First operand 5065 states. Second operand 5067 states. [2018-11-14 16:16:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:51,593 INFO L93 Difference]: Finished difference Result 5067 states and 7624 transitions. [2018-11-14 16:16:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7624 transitions. [2018-11-14 16:16:51,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:51,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:51,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:51,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-14 16:16:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-14 16:16:52,669 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-14 16:16:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:52,669 INFO L480 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-14 16:16:52,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-14 16:16:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:16:52,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:52,671 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:52,671 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:52,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:52,672 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-14 16:16:52,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:52,672 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 16:16:52,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:52,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:52,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {127868#true} call ULTIMATE.init(); {127868#true} is VALID [2018-11-14 16:16:52,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {127868#true} assume true; {127868#true} is VALID [2018-11-14 16:16:52,777 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {127868#true} {127868#true} #249#return; {127868#true} is VALID [2018-11-14 16:16:52,777 INFO L256 TraceCheckUtils]: 3: Hoare triple {127868#true} call #t~ret14 := main(); {127868#true} is VALID [2018-11-14 16:16:52,777 INFO L273 TraceCheckUtils]: 4: Hoare triple {127868#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {127868#true} is VALID [2018-11-14 16:16:52,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {127868#true} assume true; {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {127868#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {127868#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {127868#true} assume !(~p1~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {127868#true} assume !(~p2~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {127868#true} assume !(~p3~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {127868#true} assume !(~p4~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {127868#true} assume !(~p5~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {127868#true} assume !(~p6~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {127868#true} assume !(~p7~0 != 0bv32); {127868#true} is VALID [2018-11-14 16:16:52,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {127868#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,780 INFO L273 TraceCheckUtils]: 17: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,782 INFO L273 TraceCheckUtils]: 20: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p13~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {127869#false} is VALID [2018-11-14 16:16:52,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {127869#false} assume !false; {127869#false} is VALID [2018-11-14 16:16:52,790 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 16:16:52,790 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:52,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:52,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:52,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 16:16:52,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:52,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:52,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:52,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:52,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:52,825 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-14 16:16:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:59,120 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-14 16:16:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:59,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 16:16:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-14 16:16:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-14 16:16:59,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-14 16:16:59,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:17:02,155 INFO L225 Difference]: With dead ends: 8973 [2018-11-14 16:17:02,155 INFO L226 Difference]: Without dead ends: 8971 [2018-11-14 16:17:02,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:17:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-14 16:17:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-14 16:17:03,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:17:03,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand 7305 states. [2018-11-14 16:17:03,413 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand 7305 states. [2018-11-14 16:17:03,413 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand 7305 states. [2018-11-14 16:17:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:06,405 INFO L93 Difference]: Finished difference Result 8971 states and 13640 transitions. [2018-11-14 16:17:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 13640 transitions. [2018-11-14 16:17:06,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:06,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:17:06,412 INFO L74 IsIncluded]: Start isIncluded. First operand 7305 states. Second operand 8971 states. [2018-11-14 16:17:06,412 INFO L87 Difference]: Start difference. First operand 7305 states. Second operand 8971 states. [2018-11-14 16:17:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:09,462 INFO L93 Difference]: Finished difference Result 8971 states and 13640 transitions. [2018-11-14 16:17:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 13640 transitions. [2018-11-14 16:17:09,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:09,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:17:09,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:17:09,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:17:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-14 16:17:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-14 16:17:11,773 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-14 16:17:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:17:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-14 16:17:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:17:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-14 16:17:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:17:11,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:17:11,777 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:17:11,777 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:17:11,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:17:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-14 16:17:11,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:17:11,778 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 16:17:11,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:17:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:17:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:17:11,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:17:11,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {162581#true} call ULTIMATE.init(); {162581#true} is VALID [2018-11-14 16:17:11,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {162581#true} assume true; {162581#true} is VALID [2018-11-14 16:17:11,879 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {162581#true} {162581#true} #249#return; {162581#true} is VALID [2018-11-14 16:17:11,879 INFO L256 TraceCheckUtils]: 3: Hoare triple {162581#true} call #t~ret14 := main(); {162581#true} is VALID [2018-11-14 16:17:11,880 INFO L273 TraceCheckUtils]: 4: Hoare triple {162581#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {162581#true} is VALID [2018-11-14 16:17:11,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {162581#true} assume true; {162581#true} is VALID [2018-11-14 16:17:11,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {162581#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {162581#true} is VALID [2018-11-14 16:17:11,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {162581#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {162581#true} is VALID [2018-11-14 16:17:11,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {162581#true} assume !(~p1~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {162581#true} assume !(~p2~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {162581#true} assume !(~p3~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {162581#true} assume !(~p4~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {162581#true} assume !(~p5~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {162581#true} assume !(~p6~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {162581#true} assume !(~p7~0 != 0bv32); {162581#true} is VALID [2018-11-14 16:17:11,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {162581#true} assume !(~p8~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p11~0 != 0bv32;~lk11~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p12~0 != 0bv32;~lk12~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p13~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p1~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p2~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p3~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p4~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p5~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p6~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(~p7~0 != 0bv32); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:11,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume ~p8~0 != 0bv32; {162582#false} is VALID [2018-11-14 16:17:11,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {162582#false} assume ~lk8~0 != 1bv32; {162582#false} is VALID [2018-11-14 16:17:11,888 INFO L273 TraceCheckUtils]: 30: Hoare triple {162582#false} assume !false; {162582#false} is VALID [2018-11-14 16:17:11,889 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 16:17:11,890 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:17:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:17:11,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:17:11,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 16:17:11,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:17:11,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:17:11,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:17:11,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:17:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:17:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:17:11,921 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-11-14 16:17:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:26,530 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-11-14 16:17:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:17:26,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 16:17:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:17:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:17:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-14 16:17:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:17:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-14 16:17:26,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-14 16:17:26,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.