java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:06:06,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:06:06,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:06:06,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:06:06,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:06:06,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:06:06,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:06:06,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:06:06,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:06:06,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:06:06,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:06:06,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:06:06,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:06:06,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:06:06,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:06:06,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:06:06,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:06:06,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:06:06,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:06:06,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:06:06,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:06:06,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:06:06,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:06:06,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:06:06,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:06:06,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:06:06,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:06:06,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:06:06,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:06:06,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:06:06,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:06:06,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:06:06,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:06:06,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:06:06,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:06:06,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:06:06,806 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:06:06,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:06:06,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:06:06,828 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:06:06,828 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:06:06,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:06:06,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:06:06,829 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:06:06,829 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:06:06,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:06:06,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:06:06,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:06:06,830 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:06:06,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:06:06,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:06:06,832 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:06:06,832 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:06:06,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:06:06,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:06:06,835 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:06:06,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:06:06,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:06:06,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:06:06,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:06:06,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:06:06,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:06:06,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:06:06,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:06:06,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:06:06,837 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:06:06,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:06:06,837 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:06:06,838 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:06:06,839 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:06:06,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:06:06,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:06:06,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:06:06,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:06:06,917 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:06:06,918 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:06:06,992 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561ac934c/5fd8055e214e4910a6ea2a1b7fc3d978/FLAG5643c7696 [2018-11-14 18:06:07,398 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:06:07,398 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:06:07,410 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561ac934c/5fd8055e214e4910a6ea2a1b7fc3d978/FLAG5643c7696 [2018-11-14 18:06:07,424 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561ac934c/5fd8055e214e4910a6ea2a1b7fc3d978 [2018-11-14 18:06:07,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:06:07,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:06:07,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:06:07,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:06:07,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:06:07,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af34afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07, skipping insertion in model container [2018-11-14 18:06:07,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:06:07,485 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:06:07,741 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:06:07,747 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:06:07,777 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:06:07,796 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:06:07,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07 WrapperNode [2018-11-14 18:06:07,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:06:07,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:06:07,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:06:07,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:06:07,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... [2018-11-14 18:06:07,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:06:07,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:06:07,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:06:07,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:06:07,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:06:07,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:06:07,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:06:07,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:06:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:06:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:06:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:06:07,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:06:07,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:06:08,542 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:06:08,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:06:08 BoogieIcfgContainer [2018-11-14 18:06:08,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:06:08,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:06:08,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:06:08,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:06:08,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:06:07" (1/3) ... [2018-11-14 18:06:08,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7160781a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:06:08, skipping insertion in model container [2018-11-14 18:06:08,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:06:07" (2/3) ... [2018-11-14 18:06:08,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7160781a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:06:08, skipping insertion in model container [2018-11-14 18:06:08,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:06:08" (3/3) ... [2018-11-14 18:06:08,551 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 18:06:08,561 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:06:08,568 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:06:08,582 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:06:08,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:06:08,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:06:08,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:06:08,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:06:08,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:06:08,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:06:08,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:06:08,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:06:08,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:06:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 18:06:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:06:08,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:08,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:08,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:08,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -6959071, now seen corresponding path program 1 times [2018-11-14 18:06:08,647 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:08,647 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:08,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:08,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 18:06:08,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 18:06:08,951 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #113#return; {33#true} is VALID [2018-11-14 18:06:08,951 INFO L256 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret6 := main(); {33#true} is VALID [2018-11-14 18:06:08,952 INFO L273 TraceCheckUtils]: 4: Hoare triple {33#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;havoc ~cond~0; {33#true} is VALID [2018-11-14 18:06:08,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 18:06:08,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2018-11-14 18:06:08,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {33#true} is VALID [2018-11-14 18:06:08,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:08,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {62#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {34#false} is VALID [2018-11-14 18:06:08,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 18:06:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:08,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:08,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:08,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:08,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:06:08,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:08,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:09,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:09,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:09,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:09,115 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-14 18:06:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:09,622 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2018-11-14 18:06:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:09,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:06:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-14 18:06:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-14 18:06:09,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-14 18:06:09,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:09,941 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:06:09,943 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 18:06:09,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 18:06:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-14 18:06:10,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:10,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2018-11-14 18:06:10,070 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2018-11-14 18:06:10,070 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2018-11-14 18:06:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,078 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2018-11-14 18:06:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-11-14 18:06:10,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:10,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:10,080 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2018-11-14 18:06:10,080 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2018-11-14 18:06:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,087 INFO L93 Difference]: Finished difference Result 44 states and 70 transitions. [2018-11-14 18:06:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-11-14 18:06:10,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:10,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:10,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:10,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:06:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2018-11-14 18:06:10,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2018-11-14 18:06:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:10,094 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2018-11-14 18:06:10,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-14 18:06:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:06:10,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:10,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:10,096 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:10,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash -816305697, now seen corresponding path program 1 times [2018-11-14 18:06:10,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:10,098 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:10,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:10,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:10,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-14 18:06:10,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-14 18:06:10,238 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #113#return; {279#true} is VALID [2018-11-14 18:06:10,238 INFO L256 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret6 := main(); {279#true} is VALID [2018-11-14 18:06:10,239 INFO L273 TraceCheckUtils]: 4: Hoare triple {279#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;havoc ~cond~0; {279#true} is VALID [2018-11-14 18:06:10,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-14 18:06:10,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {279#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {279#true} is VALID [2018-11-14 18:06:10,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {279#true} is VALID [2018-11-14 18:06:10,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(~p1~0 != 0bv32); {308#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:10,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {308#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:10,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {308#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:10,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {308#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {308#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:10,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {308#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {308#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 18:06:10,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {280#false} is VALID [2018-11-14 18:06:10,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} assume ~lk1~0 != 1bv32; {280#false} is VALID [2018-11-14 18:06:10,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-14 18:06:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:10,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:10,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:10,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:10,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:06:10,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:10,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:10,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:10,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:10,350 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 3 states. [2018-11-14 18:06:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:10,748 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2018-11-14 18:06:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:10,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:06:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 18:06:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 18:06:10,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-14 18:06:11,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,016 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:06:11,016 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 18:06:11,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 18:06:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-14 18:06:11,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:11,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-14 18:06:11,043 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-14 18:06:11,043 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-14 18:06:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,047 INFO L93 Difference]: Finished difference Result 44 states and 68 transitions. [2018-11-14 18:06:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-11-14 18:06:11,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:11,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:11,049 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-14 18:06:11,049 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-14 18:06:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,053 INFO L93 Difference]: Finished difference Result 44 states and 68 transitions. [2018-11-14 18:06:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-11-14 18:06:11,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:11,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:11,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:11,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:06:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2018-11-14 18:06:11,058 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 16 [2018-11-14 18:06:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:11,058 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2018-11-14 18:06:11,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2018-11-14 18:06:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:06:11,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:11,060 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:11,060 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:11,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash -215516200, now seen corresponding path program 1 times [2018-11-14 18:06:11,061 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:11,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:11,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:11,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-14 18:06:11,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-14 18:06:11,216 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {546#true} {546#true} #113#return; {546#true} is VALID [2018-11-14 18:06:11,216 INFO L256 TraceCheckUtils]: 3: Hoare triple {546#true} call #t~ret6 := main(); {546#true} is VALID [2018-11-14 18:06:11,216 INFO L273 TraceCheckUtils]: 4: Hoare triple {546#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;havoc ~cond~0; {546#true} is VALID [2018-11-14 18:06:11,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-14 18:06:11,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {546#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {546#true} is VALID [2018-11-14 18:06:11,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {546#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {546#true} is VALID [2018-11-14 18:06:11,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {575#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:11,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {575#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {575#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:11,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {575#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {575#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:11,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {575#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {575#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:11,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {575#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {575#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 18:06:11,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {575#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {547#false} is VALID [2018-11-14 18:06:11,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {547#false} assume ~p2~0 != 0bv32; {547#false} is VALID [2018-11-14 18:06:11,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {547#false} assume ~lk2~0 != 1bv32; {547#false} is VALID [2018-11-14 18:06:11,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-14 18:06:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:11,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:11,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:11,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:06:11,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:11,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:11,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,272 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 3 states. [2018-11-14 18:06:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,482 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2018-11-14 18:06:11,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:11,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:06:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-14 18:06:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-14 18:06:11,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-14 18:06:11,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,712 INFO L225 Difference]: With dead ends: 67 [2018-11-14 18:06:11,712 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:06:11,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:06:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-14 18:06:11,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:11,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-14 18:06:11,746 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-14 18:06:11,746 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-14 18:06:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,750 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2018-11-14 18:06:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2018-11-14 18:06:11,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:11,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:11,752 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-14 18:06:11,752 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-14 18:06:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:11,756 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2018-11-14 18:06:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2018-11-14 18:06:11,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:11,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:11,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:11,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 18:06:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2018-11-14 18:06:11,761 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 17 [2018-11-14 18:06:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:11,761 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2018-11-14 18:06:11,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2018-11-14 18:06:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:06:11,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:11,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:11,763 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:11,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 464542170, now seen corresponding path program 1 times [2018-11-14 18:06:11,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:11,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:11,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-14 18:06:11,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-14 18:06:11,865 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #113#return; {827#true} is VALID [2018-11-14 18:06:11,865 INFO L256 TraceCheckUtils]: 3: Hoare triple {827#true} call #t~ret6 := main(); {827#true} is VALID [2018-11-14 18:06:11,866 INFO L273 TraceCheckUtils]: 4: Hoare triple {827#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;havoc ~cond~0; {827#true} is VALID [2018-11-14 18:06:11,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-14 18:06:11,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {827#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {827#true} is VALID [2018-11-14 18:06:11,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {827#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {827#true} is VALID [2018-11-14 18:06:11,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {827#true} assume !(~p1~0 != 0bv32); {827#true} is VALID [2018-11-14 18:06:11,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {827#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:11,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {859#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {828#false} is VALID [2018-11-14 18:06:11,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-14 18:06:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:11,888 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:11,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:11,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:11,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:06:11,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:11,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:11,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:11,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:11,911 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand 3 states. [2018-11-14 18:06:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,151 INFO L93 Difference]: Finished difference Result 81 states and 125 transitions. [2018-11-14 18:06:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:12,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:06:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-14 18:06:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-14 18:06:12,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-14 18:06:12,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:12,302 INFO L225 Difference]: With dead ends: 81 [2018-11-14 18:06:12,303 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 18:06:12,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 18:06:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-11-14 18:06:12,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:12,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 59 states. [2018-11-14 18:06:12,332 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 59 states. [2018-11-14 18:06:12,332 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 59 states. [2018-11-14 18:06:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,337 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-11-14 18:06:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2018-11-14 18:06:12,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,338 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 79 states. [2018-11-14 18:06:12,338 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 79 states. [2018-11-14 18:06:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,343 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-11-14 18:06:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2018-11-14 18:06:12,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:12,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:06:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2018-11-14 18:06:12,348 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 17 [2018-11-14 18:06:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:12,349 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2018-11-14 18:06:12,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2018-11-14 18:06:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:06:12,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:12,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:12,350 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:12,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -344804456, now seen corresponding path program 1 times [2018-11-14 18:06:12,351 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:12,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:12,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:12,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-14 18:06:12,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-14 18:06:12,433 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #113#return; {1198#true} is VALID [2018-11-14 18:06:12,433 INFO L256 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret6 := main(); {1198#true} is VALID [2018-11-14 18:06:12,434 INFO L273 TraceCheckUtils]: 4: Hoare triple {1198#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;havoc ~cond~0; {1198#true} is VALID [2018-11-14 18:06:12,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-14 18:06:12,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {1198#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {1198#true} is VALID [2018-11-14 18:06:12,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {1198#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {1198#true} is VALID [2018-11-14 18:06:12,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#true} assume !(~p1~0 != 0bv32); {1198#true} is VALID [2018-11-14 18:06:12,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {1198#true} assume !(~p2~0 != 0bv32); {1230#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:12,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {1230#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1230#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:12,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {1230#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1230#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:12,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {1230#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {1230#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:12,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {1230#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {1230#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 18:06:12,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {1230#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {1199#false} is VALID [2018-11-14 18:06:12,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {1199#false} assume ~lk2~0 != 1bv32; {1199#false} is VALID [2018-11-14 18:06:12,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-14 18:06:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:12,441 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:12,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:12,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:12,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:06:12,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:12,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:12,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:12,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:12,465 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand 3 states. [2018-11-14 18:06:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,638 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2018-11-14 18:06:12,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:12,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:06:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-14 18:06:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2018-11-14 18:06:12,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2018-11-14 18:06:12,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:12,856 INFO L225 Difference]: With dead ends: 131 [2018-11-14 18:06:12,857 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 18:06:12,859 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 18:06:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-14 18:06:12,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:12,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2018-11-14 18:06:12,932 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2018-11-14 18:06:12,932 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2018-11-14 18:06:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,936 INFO L93 Difference]: Finished difference Result 81 states and 120 transitions. [2018-11-14 18:06:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2018-11-14 18:06:12,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,937 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2018-11-14 18:06:12,938 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2018-11-14 18:06:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:12,942 INFO L93 Difference]: Finished difference Result 81 states and 120 transitions. [2018-11-14 18:06:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2018-11-14 18:06:12,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:12,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:12,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:12,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 18:06:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2018-11-14 18:06:12,947 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 17 [2018-11-14 18:06:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:12,947 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2018-11-14 18:06:12,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2018-11-14 18:06:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:06:12,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:12,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:12,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:12,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:12,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1516120724, now seen corresponding path program 1 times [2018-11-14 18:06:12,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:12,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:12,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:13,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {1647#true} call ULTIMATE.init(); {1647#true} is VALID [2018-11-14 18:06:13,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {1647#true} assume true; {1647#true} is VALID [2018-11-14 18:06:13,029 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1647#true} {1647#true} #113#return; {1647#true} is VALID [2018-11-14 18:06:13,029 INFO L256 TraceCheckUtils]: 3: Hoare triple {1647#true} call #t~ret6 := main(); {1647#true} is VALID [2018-11-14 18:06:13,029 INFO L273 TraceCheckUtils]: 4: Hoare triple {1647#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;havoc ~cond~0; {1647#true} is VALID [2018-11-14 18:06:13,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {1647#true} assume true; {1647#true} is VALID [2018-11-14 18:06:13,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {1647#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {1647#true} is VALID [2018-11-14 18:06:13,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {1647#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {1647#true} is VALID [2018-11-14 18:06:13,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {1647#true} assume !(~p1~0 != 0bv32); {1647#true} is VALID [2018-11-14 18:06:13,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {1647#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1679#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {1679#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1679#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {1679#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1679#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {1679#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {1679#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {1679#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {1679#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 18:06:13,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {1679#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {1648#false} is VALID [2018-11-14 18:06:13,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {1648#false} assume ~p3~0 != 0bv32; {1648#false} is VALID [2018-11-14 18:06:13,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {1648#false} assume ~lk3~0 != 1bv32; {1648#false} is VALID [2018-11-14 18:06:13,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {1648#false} assume !false; {1648#false} is VALID [2018-11-14 18:06:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:13,042 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:13,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:13,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:13,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:06:13,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:13,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:13,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:13,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,065 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand 3 states. [2018-11-14 18:06:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,267 INFO L93 Difference]: Finished difference Result 118 states and 176 transitions. [2018-11-14 18:06:13,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:13,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:06:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-14 18:06:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-14 18:06:13,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-14 18:06:13,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,391 INFO L225 Difference]: With dead ends: 118 [2018-11-14 18:06:13,391 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 18:06:13,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 18:06:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-14 18:06:13,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:13,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-14 18:06:13,430 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-14 18:06:13,430 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-14 18:06:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,432 INFO L93 Difference]: Finished difference Result 83 states and 120 transitions. [2018-11-14 18:06:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2018-11-14 18:06:13,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,433 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-14 18:06:13,433 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-14 18:06:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,437 INFO L93 Difference]: Finished difference Result 83 states and 120 transitions. [2018-11-14 18:06:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2018-11-14 18:06:13,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:13,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 18:06:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2018-11-14 18:06:13,441 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 18 [2018-11-14 18:06:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:13,442 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2018-11-14 18:06:13,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2018-11-14 18:06:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:06:13,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:13,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:13,443 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:13,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2098788202, now seen corresponding path program 1 times [2018-11-14 18:06:13,444 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:13,444 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:13,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:13,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {2092#true} call ULTIMATE.init(); {2092#true} is VALID [2018-11-14 18:06:13,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {2092#true} assume true; {2092#true} is VALID [2018-11-14 18:06:13,526 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2092#true} {2092#true} #113#return; {2092#true} is VALID [2018-11-14 18:06:13,526 INFO L256 TraceCheckUtils]: 3: Hoare triple {2092#true} call #t~ret6 := main(); {2092#true} is VALID [2018-11-14 18:06:13,526 INFO L273 TraceCheckUtils]: 4: Hoare triple {2092#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;havoc ~cond~0; {2092#true} is VALID [2018-11-14 18:06:13,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {2092#true} assume true; {2092#true} is VALID [2018-11-14 18:06:13,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {2092#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {2092#true} is VALID [2018-11-14 18:06:13,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {2092#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {2092#true} is VALID [2018-11-14 18:06:13,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {2092#true} assume !(~p1~0 != 0bv32); {2092#true} is VALID [2018-11-14 18:06:13,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {2092#true} assume !(~p2~0 != 0bv32); {2092#true} is VALID [2018-11-14 18:06:13,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {2092#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:13,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {2127#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {2093#false} is VALID [2018-11-14 18:06:13,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {2093#false} assume !false; {2093#false} is VALID [2018-11-14 18:06:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:13,539 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:13,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:13,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:06:13,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:13,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:13,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,566 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand 3 states. [2018-11-14 18:06:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,717 INFO L93 Difference]: Finished difference Result 141 states and 209 transitions. [2018-11-14 18:06:13,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:13,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:06:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 18:06:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 18:06:13,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-14 18:06:13,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:13,791 INFO L225 Difference]: With dead ends: 141 [2018-11-14 18:06:13,792 INFO L226 Difference]: Without dead ends: 139 [2018-11-14 18:06:13,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-14 18:06:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-14 18:06:13,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:13,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 109 states. [2018-11-14 18:06:13,836 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 109 states. [2018-11-14 18:06:13,836 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 109 states. [2018-11-14 18:06:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,842 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2018-11-14 18:06:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2018-11-14 18:06:13,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,843 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 139 states. [2018-11-14 18:06:13,843 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 139 states. [2018-11-14 18:06:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:13,849 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2018-11-14 18:06:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2018-11-14 18:06:13,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:13,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:13,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:13,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-14 18:06:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2018-11-14 18:06:13,854 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 18 [2018-11-14 18:06:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:13,855 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2018-11-14 18:06:13,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2018-11-14 18:06:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:06:13,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:13,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:13,856 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:13,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1386832468, now seen corresponding path program 1 times [2018-11-14 18:06:13,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:13,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:13,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {2702#true} call ULTIMATE.init(); {2702#true} is VALID [2018-11-14 18:06:13,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 18:06:13,963 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2702#true} {2702#true} #113#return; {2702#true} is VALID [2018-11-14 18:06:13,963 INFO L256 TraceCheckUtils]: 3: Hoare triple {2702#true} call #t~ret6 := main(); {2702#true} is VALID [2018-11-14 18:06:13,963 INFO L273 TraceCheckUtils]: 4: Hoare triple {2702#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;havoc ~cond~0; {2702#true} is VALID [2018-11-14 18:06:13,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 18:06:13,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {2702#true} is VALID [2018-11-14 18:06:13,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {2702#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {2702#true} is VALID [2018-11-14 18:06:13,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {2702#true} assume !(~p1~0 != 0bv32); {2702#true} is VALID [2018-11-14 18:06:13,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {2702#true} assume !(~p2~0 != 0bv32); {2702#true} is VALID [2018-11-14 18:06:13,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {2702#true} assume !(~p3~0 != 0bv32); {2737#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:13,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {2737#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2737#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:13,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {2737#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {2737#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:13,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {2737#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {2737#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:13,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {2737#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {2737#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 18:06:13,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {2737#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {2703#false} is VALID [2018-11-14 18:06:13,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {2703#false} assume ~lk3~0 != 1bv32; {2703#false} is VALID [2018-11-14 18:06:13,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {2703#false} assume !false; {2703#false} is VALID [2018-11-14 18:06:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:13,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:13,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:13,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:13,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:06:13,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:13,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:14,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:14,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:14,012 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2018-11-14 18:06:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,191 INFO L93 Difference]: Finished difference Result 245 states and 357 transitions. [2018-11-14 18:06:14,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:14,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:06:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-14 18:06:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-14 18:06:14,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-14 18:06:14,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:14,331 INFO L225 Difference]: With dead ends: 245 [2018-11-14 18:06:14,331 INFO L226 Difference]: Without dead ends: 147 [2018-11-14 18:06:14,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-14 18:06:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-14 18:06:14,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:14,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 145 states. [2018-11-14 18:06:14,413 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 145 states. [2018-11-14 18:06:14,413 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 145 states. [2018-11-14 18:06:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,419 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2018-11-14 18:06:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2018-11-14 18:06:14,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:14,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:14,420 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 147 states. [2018-11-14 18:06:14,420 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 147 states. [2018-11-14 18:06:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:14,426 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2018-11-14 18:06:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 204 transitions. [2018-11-14 18:06:14,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:14,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:14,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:14,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-14 18:06:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-14 18:06:14,432 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 18 [2018-11-14 18:06:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:14,433 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-14 18:06:14,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-14 18:06:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:06:14,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:14,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:14,434 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:14,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash -637709139, now seen corresponding path program 1 times [2018-11-14 18:06:14,435 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:14,435 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:14,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:14,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:14,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {3476#true} call ULTIMATE.init(); {3476#true} is VALID [2018-11-14 18:06:14,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {3476#true} assume true; {3476#true} is VALID [2018-11-14 18:06:14,956 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3476#true} {3476#true} #113#return; {3476#true} is VALID [2018-11-14 18:06:14,956 INFO L256 TraceCheckUtils]: 3: Hoare triple {3476#true} call #t~ret6 := main(); {3476#true} is VALID [2018-11-14 18:06:14,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {3476#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;havoc ~cond~0; {3476#true} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {3476#true} assume true; {3476#true} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {3476#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {3476#true} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {3476#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {3476#true} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {3476#true} assume !(~p1~0 != 0bv32); {3476#true} is VALID [2018-11-14 18:06:14,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {3476#true} assume !(~p2~0 != 0bv32); {3476#true} is VALID [2018-11-14 18:06:14,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {3476#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3511#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:14,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {3511#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3511#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:14,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {3511#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {3511#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:14,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {3511#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {3511#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:14,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {3511#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {3511#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 18:06:14,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {3511#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {3477#false} is VALID [2018-11-14 18:06:14,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {3477#false} assume ~p4~0 != 0bv32; {3477#false} is VALID [2018-11-14 18:06:14,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {3477#false} assume ~lk4~0 != 1bv32; {3477#false} is VALID [2018-11-14 18:06:14,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {3477#false} assume !false; {3477#false} is VALID [2018-11-14 18:06:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:14,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:14,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:14,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:14,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:06:14,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:14,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:14,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:14,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:14,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:14,987 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 3 states. [2018-11-14 18:06:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,196 INFO L93 Difference]: Finished difference Result 217 states and 301 transitions. [2018-11-14 18:06:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:15,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:06:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 18:06:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 18:06:15,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-14 18:06:15,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:15,328 INFO L225 Difference]: With dead ends: 217 [2018-11-14 18:06:15,328 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 18:06:15,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 18:06:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-14 18:06:15,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:15,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 149 states. [2018-11-14 18:06:15,411 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 149 states. [2018-11-14 18:06:15,411 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 149 states. [2018-11-14 18:06:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,416 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2018-11-14 18:06:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2018-11-14 18:06:15,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:15,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:15,417 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 151 states. [2018-11-14 18:06:15,417 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 151 states. [2018-11-14 18:06:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,421 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2018-11-14 18:06:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2018-11-14 18:06:15,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:15,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:15,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:15,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 18:06:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2018-11-14 18:06:15,425 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 19 [2018-11-14 18:06:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:15,426 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2018-11-14 18:06:15,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-11-14 18:06:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:06:15,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:15,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:15,427 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:15,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash 42349231, now seen corresponding path program 1 times [2018-11-14 18:06:15,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:15,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:15,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:15,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:15,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {4237#true} call ULTIMATE.init(); {4237#true} is VALID [2018-11-14 18:06:15,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {4237#true} assume true; {4237#true} is VALID [2018-11-14 18:06:15,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4237#true} {4237#true} #113#return; {4237#true} is VALID [2018-11-14 18:06:15,508 INFO L256 TraceCheckUtils]: 3: Hoare triple {4237#true} call #t~ret6 := main(); {4237#true} is VALID [2018-11-14 18:06:15,508 INFO L273 TraceCheckUtils]: 4: Hoare triple {4237#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;havoc ~cond~0; {4237#true} is VALID [2018-11-14 18:06:15,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {4237#true} assume true; {4237#true} is VALID [2018-11-14 18:06:15,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {4237#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {4237#true} is VALID [2018-11-14 18:06:15,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {4237#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {4237#true} is VALID [2018-11-14 18:06:15,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {4237#true} assume !(~p1~0 != 0bv32); {4237#true} is VALID [2018-11-14 18:06:15,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {4237#true} assume !(~p2~0 != 0bv32); {4237#true} is VALID [2018-11-14 18:06:15,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {4237#true} assume !(~p3~0 != 0bv32); {4237#true} is VALID [2018-11-14 18:06:15,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {4237#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:15,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:15,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:15,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:15,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:15,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:15,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {4275#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {4238#false} is VALID [2018-11-14 18:06:15,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {4238#false} assume !false; {4238#false} is VALID [2018-11-14 18:06:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:15,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:15,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:06:15,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:15,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:15,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:15,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:15,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:15,552 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 3 states. [2018-11-14 18:06:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:15,899 INFO L93 Difference]: Finished difference Result 253 states and 345 transitions. [2018-11-14 18:06:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:15,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:06:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:06:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:06:15,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 18:06:15,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:15,974 INFO L225 Difference]: With dead ends: 253 [2018-11-14 18:06:15,974 INFO L226 Difference]: Without dead ends: 251 [2018-11-14 18:06:15,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-14 18:06:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 209. [2018-11-14 18:06:16,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:16,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand 209 states. [2018-11-14 18:06:16,094 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 209 states. [2018-11-14 18:06:16,094 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 209 states. [2018-11-14 18:06:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:16,101 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2018-11-14 18:06:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 336 transitions. [2018-11-14 18:06:16,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:16,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:16,102 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 251 states. [2018-11-14 18:06:16,102 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 251 states. [2018-11-14 18:06:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:16,109 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2018-11-14 18:06:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 336 transitions. [2018-11-14 18:06:16,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:16,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:16,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:16,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-14 18:06:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2018-11-14 18:06:16,115 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 279 transitions. Word has length 19 [2018-11-14 18:06:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:16,115 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 279 transitions. [2018-11-14 18:06:16,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 279 transitions. [2018-11-14 18:06:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:06:16,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:16,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:06:16,116 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:16,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -766997395, now seen corresponding path program 1 times [2018-11-14 18:06:16,117 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:16,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:16,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:16,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {5298#true} call ULTIMATE.init(); {5298#true} is VALID [2018-11-14 18:06:16,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {5298#true} assume true; {5298#true} is VALID [2018-11-14 18:06:16,303 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5298#true} {5298#true} #113#return; {5298#true} is VALID [2018-11-14 18:06:16,303 INFO L256 TraceCheckUtils]: 3: Hoare triple {5298#true} call #t~ret6 := main(); {5298#true} is VALID [2018-11-14 18:06:16,304 INFO L273 TraceCheckUtils]: 4: Hoare triple {5298#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;havoc ~cond~0; {5298#true} is VALID [2018-11-14 18:06:16,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {5298#true} assume true; {5298#true} is VALID [2018-11-14 18:06:16,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {5298#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {5298#true} is VALID [2018-11-14 18:06:16,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {5298#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {5298#true} is VALID [2018-11-14 18:06:16,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {5298#true} assume !(~p1~0 != 0bv32); {5298#true} is VALID [2018-11-14 18:06:16,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {5298#true} assume !(~p2~0 != 0bv32); {5298#true} is VALID [2018-11-14 18:06:16,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {5298#true} assume !(~p3~0 != 0bv32); {5298#true} is VALID [2018-11-14 18:06:16,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {5298#true} assume !(~p4~0 != 0bv32); {5336#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:16,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {5336#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {5336#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:16,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {5336#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {5336#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:16,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {5336#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {5336#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:16,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {5336#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {5336#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 18:06:16,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {5336#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {5299#false} is VALID [2018-11-14 18:06:16,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {5299#false} assume ~lk4~0 != 1bv32; {5299#false} is VALID [2018-11-14 18:06:16,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {5299#false} assume !false; {5299#false} is VALID [2018-11-14 18:06:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:16,309 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:16,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:16,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:16,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:06:16,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:16,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:16,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:16,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:16,339 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand 3 states. [2018-11-14 18:06:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:16,545 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2018-11-14 18:06:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:16,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 18:06:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-14 18:06:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2018-11-14 18:06:16,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2018-11-14 18:06:17,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:17,118 INFO L225 Difference]: With dead ends: 469 [2018-11-14 18:06:17,119 INFO L226 Difference]: Without dead ends: 275 [2018-11-14 18:06:17,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-14 18:06:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-11-14 18:06:17,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:17,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 273 states. [2018-11-14 18:06:17,330 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 273 states. [2018-11-14 18:06:17,330 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 273 states. [2018-11-14 18:06:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:17,336 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2018-11-14 18:06:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2018-11-14 18:06:17,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:17,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:17,338 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 275 states. [2018-11-14 18:06:17,338 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 275 states. [2018-11-14 18:06:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:17,345 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2018-11-14 18:06:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2018-11-14 18:06:17,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:17,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:17,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:17,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-14 18:06:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 343 transitions. [2018-11-14 18:06:17,354 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 343 transitions. Word has length 19 [2018-11-14 18:06:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:17,354 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 343 transitions. [2018-11-14 18:06:17,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 343 transitions. [2018-11-14 18:06:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:06:17,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:17,355 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] [2018-11-14 18:06:17,355 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:17,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1313042185, now seen corresponding path program 1 times [2018-11-14 18:06:17,356 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:17,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:17,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {6703#true} call ULTIMATE.init(); {6703#true} is VALID [2018-11-14 18:06:17,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {6703#true} assume true; {6703#true} is VALID [2018-11-14 18:06:17,788 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6703#true} {6703#true} #113#return; {6703#true} is VALID [2018-11-14 18:06:17,789 INFO L256 TraceCheckUtils]: 3: Hoare triple {6703#true} call #t~ret6 := main(); {6703#true} is VALID [2018-11-14 18:06:17,789 INFO L273 TraceCheckUtils]: 4: Hoare triple {6703#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;havoc ~cond~0; {6703#true} is VALID [2018-11-14 18:06:17,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {6703#true} assume true; {6703#true} is VALID [2018-11-14 18:06:17,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {6703#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {6703#true} is VALID [2018-11-14 18:06:17,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {6703#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {6703#true} is VALID [2018-11-14 18:06:17,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {6703#true} assume !(~p1~0 != 0bv32); {6703#true} is VALID [2018-11-14 18:06:17,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {6703#true} assume !(~p2~0 != 0bv32); {6703#true} is VALID [2018-11-14 18:06:17,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {6703#true} assume !(~p3~0 != 0bv32); {6703#true} is VALID [2018-11-14 18:06:17,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {6703#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {6741#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:17,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {6741#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {6741#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:17,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {6741#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {6741#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:17,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {6741#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {6741#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:17,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {6741#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {6741#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 18:06:17,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {6741#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {6704#false} is VALID [2018-11-14 18:06:17,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {6704#false} assume ~p5~0 != 0bv32; {6704#false} is VALID [2018-11-14 18:06:17,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {6704#false} assume ~lk5~0 != 1bv32; {6704#false} is VALID [2018-11-14 18:06:17,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {6704#false} assume !false; {6704#false} is VALID [2018-11-14 18:06:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:17,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:17,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:17,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:06:17,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:17,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:17,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:17,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:17,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:17,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:17,823 INFO L87 Difference]: Start difference. First operand 273 states and 343 transitions. Second operand 3 states. [2018-11-14 18:06:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,132 INFO L93 Difference]: Finished difference Result 409 states and 509 transitions. [2018-11-14 18:06:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:18,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:06:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 18:06:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 18:06:18,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-14 18:06:18,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:18,662 INFO L225 Difference]: With dead ends: 409 [2018-11-14 18:06:18,662 INFO L226 Difference]: Without dead ends: 283 [2018-11-14 18:06:18,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-14 18:06:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-11-14 18:06:18,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:18,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand 281 states. [2018-11-14 18:06:18,779 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand 281 states. [2018-11-14 18:06:18,779 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 281 states. [2018-11-14 18:06:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,786 INFO L93 Difference]: Finished difference Result 283 states and 344 transitions. [2018-11-14 18:06:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 344 transitions. [2018-11-14 18:06:18,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:18,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:18,787 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 283 states. [2018-11-14 18:06:18,787 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 283 states. [2018-11-14 18:06:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:18,795 INFO L93 Difference]: Finished difference Result 283 states and 344 transitions. [2018-11-14 18:06:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 344 transitions. [2018-11-14 18:06:18,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:18,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:18,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:18,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-14 18:06:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 343 transitions. [2018-11-14 18:06:18,803 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 343 transitions. Word has length 20 [2018-11-14 18:06:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:18,803 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 343 transitions. [2018-11-14 18:06:18,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 343 transitions. [2018-11-14 18:06:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:06:18,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:18,805 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] [2018-11-14 18:06:18,805 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:18,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:18,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1993100555, now seen corresponding path program 1 times [2018-11-14 18:06:18,805 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:18,806 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:18,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:18,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:19,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {8075#true} call ULTIMATE.init(); {8075#true} is VALID [2018-11-14 18:06:19,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {8075#true} assume true; {8075#true} is VALID [2018-11-14 18:06:19,166 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8075#true} {8075#true} #113#return; {8075#true} is VALID [2018-11-14 18:06:19,166 INFO L256 TraceCheckUtils]: 3: Hoare triple {8075#true} call #t~ret6 := main(); {8075#true} is VALID [2018-11-14 18:06:19,166 INFO L273 TraceCheckUtils]: 4: Hoare triple {8075#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;havoc ~cond~0; {8075#true} is VALID [2018-11-14 18:06:19,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {8075#true} assume true; {8075#true} is VALID [2018-11-14 18:06:19,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {8075#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {8075#true} is VALID [2018-11-14 18:06:19,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {8075#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {8075#true} is VALID [2018-11-14 18:06:19,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {8075#true} assume !(~p1~0 != 0bv32); {8075#true} is VALID [2018-11-14 18:06:19,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {8075#true} assume !(~p2~0 != 0bv32); {8075#true} is VALID [2018-11-14 18:06:19,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {8075#true} assume !(~p3~0 != 0bv32); {8075#true} is VALID [2018-11-14 18:06:19,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {8075#true} assume !(~p4~0 != 0bv32); {8075#true} is VALID [2018-11-14 18:06:19,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {8075#true} assume !(~p5~0 != 0bv32); {8116#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:19,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {8116#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {8116#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:19,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {8116#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {8116#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:19,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {8116#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {8116#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:19,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {8116#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {8116#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 18:06:19,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {8116#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {8076#false} is VALID [2018-11-14 18:06:19,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {8076#false} assume ~lk5~0 != 1bv32; {8076#false} is VALID [2018-11-14 18:06:19,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {8076#false} assume !false; {8076#false} is VALID [2018-11-14 18:06:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:19,173 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:19,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:19,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:19,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:06:19,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:19,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:19,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:19,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:19,192 INFO L87 Difference]: Start difference. First operand 281 states and 343 transitions. Second operand 3 states. [2018-11-14 18:06:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:19,989 INFO L93 Difference]: Finished difference Result 779 states and 920 transitions. [2018-11-14 18:06:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:19,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:06:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-14 18:06:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-14 18:06:19,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-14 18:06:20,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:20,614 INFO L225 Difference]: With dead ends: 779 [2018-11-14 18:06:20,614 INFO L226 Difference]: Without dead ends: 281 [2018-11-14 18:06:20,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-14 18:06:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-14 18:06:20,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:20,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand 281 states. [2018-11-14 18:06:20,890 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 281 states. [2018-11-14 18:06:20,890 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 281 states. [2018-11-14 18:06:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:20,897 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-14 18:06:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-14 18:06:20,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:20,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:20,898 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 281 states. [2018-11-14 18:06:20,898 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 281 states. [2018-11-14 18:06:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:20,905 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-14 18:06:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-14 18:06:20,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:20,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:20,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:20,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-14 18:06:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 311 transitions. [2018-11-14 18:06:20,914 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 311 transitions. Word has length 20 [2018-11-14 18:06:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:20,914 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 311 transitions. [2018-11-14 18:06:20,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-11-14 18:06:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:06:20,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:06:20,916 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] [2018-11-14 18:06:20,916 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:06:20,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:06:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1492520115, now seen corresponding path program 1 times [2018-11-14 18:06:20,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:06:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:06:20,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:06:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:06:20,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:06:21,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {9836#true} call ULTIMATE.init(); {9836#true} is VALID [2018-11-14 18:06:21,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {9836#true} assume true; {9836#true} is VALID [2018-11-14 18:06:21,361 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9836#true} {9836#true} #113#return; {9836#true} is VALID [2018-11-14 18:06:21,361 INFO L256 TraceCheckUtils]: 3: Hoare triple {9836#true} call #t~ret6 := main(); {9836#true} is VALID [2018-11-14 18:06:21,361 INFO L273 TraceCheckUtils]: 4: Hoare triple {9836#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;havoc ~cond~0; {9836#true} is VALID [2018-11-14 18:06:21,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {9836#true} assume true; {9836#true} is VALID [2018-11-14 18:06:21,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {9836#true} assume !false;~cond~0 := #t~nondet5;havoc #t~nondet5; {9836#true} is VALID [2018-11-14 18:06:21,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {9836#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32; {9836#true} is VALID [2018-11-14 18:06:21,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {9836#true} assume !(~p1~0 != 0bv32); {9836#true} is VALID [2018-11-14 18:06:21,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {9836#true} assume !(~p2~0 != 0bv32); {9836#true} is VALID [2018-11-14 18:06:21,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {9836#true} assume !(~p3~0 != 0bv32); {9836#true} is VALID [2018-11-14 18:06:21,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {9836#true} assume !(~p4~0 != 0bv32); {9836#true} is VALID [2018-11-14 18:06:21,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {9836#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:21,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:21,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:21,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:21,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:21,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:06:21,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {9877#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {9837#false} is VALID [2018-11-14 18:06:21,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {9837#false} assume !false; {9837#false} is VALID [2018-11-14 18:06:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:06:21,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:06:21,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:06:21,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:06:21,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:06:21,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:06:21,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:06:21,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:21,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:06:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:06:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:21,430 INFO L87 Difference]: Start difference. First operand 281 states and 311 transitions. Second operand 3 states. [2018-11-14 18:06:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:21,635 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-11-14 18:06:21,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:06:21,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:06:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:06:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-14 18:06:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:06:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-14 18:06:21,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2018-11-14 18:06:22,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:06:22,054 INFO L225 Difference]: With dead ends: 281 [2018-11-14 18:06:22,054 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:06:22,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:06:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:06:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:06:22,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:06:22,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:06:22,056 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:06:22,056 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:06:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:22,056 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:06:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:06:22,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:22,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:22,057 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:06:22,057 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:06:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:06:22,057 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:06:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:06:22,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:22,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:06:22,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:06:22,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:06:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:06:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:06:22,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-14 18:06:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:06:22,058 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:06:22,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:06:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:06:22,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:06:22,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:06:22,245 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 18:06:22,245 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:06:22,245 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:06:22,245 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:06:22,245 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:06:22,245 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:06:22,245 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-14 18:06:22,245 INFO L428 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-14 18:06:22,245 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,246 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L428 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-14 18:06:22,247 INFO L421 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-14 18:06:22,247 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-14 18:06:22,249 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:06:22,249 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 18:06:22,250 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2018-11-14 18:06:22,251 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-14 18:06:22,252 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-14 18:06:22,253 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-14 18:06:22,254 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-14 18:06:22,254 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-14 18:06:22,254 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 18:06:22,254 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 18:06:22,254 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-14 18:06:22,254 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2018-11-14 18:06:22,254 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:06:22,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:06:22 BoogieIcfgContainer [2018-11-14 18:06:22,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:06:22,263 INFO L168 Benchmark]: Toolchain (without parser) took 14827.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 871.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -546.1 MB). Peak memory consumption was 325.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:06:22,265 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:06:22,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:06:22,266 INFO L168 Benchmark]: Boogie Preprocessor took 49.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:06:22,267 INFO L168 Benchmark]: RCFGBuilder took 694.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:06:22,268 INFO L168 Benchmark]: TraceAbstraction took 13718.14 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 215.6 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:06:22,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 359.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 694.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13718.14 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 215.6 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 664 SDtfs, 297 SDslu, 428 SDs, 0 SdLazy, 73 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 121 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 8080 SizeOfPredicates, 5 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...