java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:16:08,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:16:08,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:16:08,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:16:08,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:16:08,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:16:08,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:16:08,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:16:08,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:16:08,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:16:08,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:16:08,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:16:08,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:16:08,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:16:08,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:16:08,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:16:08,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:16:08,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:16:08,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:16:08,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:16:08,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:16:08,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:16:08,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:16:08,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:16:08,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:16:08,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:16:08,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:16:08,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:16:08,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:16:08,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:16:08,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:16:08,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:16:08,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:16:08,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:16:08,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:16:08,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:16:08,826 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:16:08,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:16:08,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:16:08,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:16:08,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:16:08,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:16:08,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:16:08,854 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:16:08,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:16:08,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:16:08,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:16:08,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:16:08,856 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:16:08,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:16:08,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:16:08,856 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:16:08,857 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:16:08,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:16:08,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:16:08,857 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:16:08,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:16:08,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:16:08,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:16:08,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:16:08,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:16:08,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:16:08,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:16:08,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:16:08,860 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:16:08,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:16:08,860 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:16:08,861 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:16:08,861 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:16:08,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:16:08,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:16:08,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:16:08,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:16:08,928 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:16:08,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:16:08,998 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1816e255e/3f60879930ac44389da9d38fda95dde0/FLAGf0908d93a [2018-11-14 16:16:09,471 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:16:09,472 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:16:09,480 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1816e255e/3f60879930ac44389da9d38fda95dde0/FLAGf0908d93a [2018-11-14 16:16:09,495 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1816e255e/3f60879930ac44389da9d38fda95dde0 [2018-11-14 16:16:09,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:16:09,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:16:09,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:16:09,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:16:09,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:16:09,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb9594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09, skipping insertion in model container [2018-11-14 16:16:09,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:16:09,553 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:16:09,768 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:16:09,777 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:16:09,810 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:16:09,827 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:16:09,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09 WrapperNode [2018-11-14 16:16:09,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:16:09,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:16:09,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:16:09,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:16:09,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... [2018-11-14 16:16:09,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:16:09,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:16:09,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:16:09,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:16:09,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:16:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:16:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:16:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:16:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:16:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:16:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:16:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:16:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:16:10,744 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:16:10,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:16:10 BoogieIcfgContainer [2018-11-14 16:16:10,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:16:10,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:16:10,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:16:10,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:16:10,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:16:09" (1/3) ... [2018-11-14 16:16:10,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b276893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:16:10, skipping insertion in model container [2018-11-14 16:16:10,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:16:09" (2/3) ... [2018-11-14 16:16:10,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b276893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:16:10, skipping insertion in model container [2018-11-14 16:16:10,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:16:10" (3/3) ... [2018-11-14 16:16:10,755 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:16:10,765 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:16:10,773 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:16:10,791 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:16:10,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:16:10,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:16:10,830 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:16:10,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:16:10,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:16:10,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:16:10,831 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:16:10,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:16:10,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:16:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-14 16:16:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:16:10,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:10,861 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 16:16:10,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:10,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-11-14 16:16:10,875 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:10,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:10,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:11,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-14 16:16:11,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-14 16:16:11,350 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #164#return; {42#true} is VALID [2018-11-14 16:16:11,350 INFO L256 TraceCheckUtils]: 3: Hoare triple {42#true} call #t~ret9 := main(); {42#true} is VALID [2018-11-14 16:16:11,351 INFO L273 TraceCheckUtils]: 4: Hoare triple {42#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {42#true} is VALID [2018-11-14 16:16:11,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-14 16:16:11,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {42#true} is VALID [2018-11-14 16:16:11,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {42#true} is VALID [2018-11-14 16:16:11,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:11,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {71#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {43#false} is VALID [2018-11-14 16:16:11,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-14 16:16:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:11,385 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:11,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:11,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:16:11,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:11,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:11,490 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 16:16:11,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:11,500 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-14 16:16:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:11,999 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-11-14 16:16:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:12,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:16:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 16:16:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 16:16:12,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-14 16:16:12,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:12,740 INFO L225 Difference]: With dead ends: 77 [2018-11-14 16:16:12,740 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:16:12,744 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 16:16:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:16:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-14 16:16:12,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:12,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 43 states. [2018-11-14 16:16:12,799 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 43 states. [2018-11-14 16:16:12,799 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 43 states. [2018-11-14 16:16:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:12,808 INFO L93 Difference]: Finished difference Result 62 states and 106 transitions. [2018-11-14 16:16:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 106 transitions. [2018-11-14 16:16:12,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:12,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:12,810 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 62 states. [2018-11-14 16:16:12,810 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 62 states. [2018-11-14 16:16:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:12,819 INFO L93 Difference]: Finished difference Result 62 states and 106 transitions. [2018-11-14 16:16:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 106 transitions. [2018-11-14 16:16:12,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:12,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:12,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:12,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 16:16:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-11-14 16:16:12,828 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-11-14 16:16:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:12,828 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-11-14 16:16:12,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-11-14 16:16:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:16:12,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:12,830 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 16:16:12,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:12,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-11-14 16:16:12,831 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:12,832 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:12,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:12,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:12,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2018-11-14 16:16:12,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2018-11-14 16:16:12,963 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #164#return; {363#true} is VALID [2018-11-14 16:16:12,963 INFO L256 TraceCheckUtils]: 3: Hoare triple {363#true} call #t~ret9 := main(); {363#true} is VALID [2018-11-14 16:16:12,963 INFO L273 TraceCheckUtils]: 4: Hoare triple {363#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {363#true} is VALID [2018-11-14 16:16:12,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {363#true} assume true; {363#true} is VALID [2018-11-14 16:16:12,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {363#true} is VALID [2018-11-14 16:16:12,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {363#true} is VALID [2018-11-14 16:16:12,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(~p1~0 != 0bv32); {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {392#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:16:12,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {364#false} is VALID [2018-11-14 16:16:12,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {364#false} assume ~lk1~0 != 1bv32; {364#false} is VALID [2018-11-14 16:16:12,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {364#false} assume !false; {364#false} is VALID [2018-11-14 16:16:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:12,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:12,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:12,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:12,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:16:12,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:12,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:13,028 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 16:16:13,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:13,029 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-11-14 16:16:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:13,439 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-11-14 16:16:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:13,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:16:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-14 16:16:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-14 16:16:13,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-14 16:16:13,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:13,779 INFO L225 Difference]: With dead ends: 100 [2018-11-14 16:16:13,779 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:16:13,780 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 16:16:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:16:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-14 16:16:13,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:13,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-14 16:16:13,810 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-14 16:16:13,810 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-14 16:16:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:13,815 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2018-11-14 16:16:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2018-11-14 16:16:13,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:13,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:13,819 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-14 16:16:13,820 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-14 16:16:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:13,824 INFO L93 Difference]: Finished difference Result 62 states and 104 transitions. [2018-11-14 16:16:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2018-11-14 16:16:13,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:13,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:13,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:13,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:16:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-11-14 16:16:13,830 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-11-14 16:16:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:13,830 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-11-14 16:16:13,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-11-14 16:16:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:16:13,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:13,832 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 16:16:13,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:13,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-11-14 16:16:13,833 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:13,833 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:13,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:13,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2018-11-14 16:16:13,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-14 16:16:13,941 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #164#return; {723#true} is VALID [2018-11-14 16:16:13,941 INFO L256 TraceCheckUtils]: 3: Hoare triple {723#true} call #t~ret9 := main(); {723#true} is VALID [2018-11-14 16:16:13,941 INFO L273 TraceCheckUtils]: 4: Hoare triple {723#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {723#true} is VALID [2018-11-14 16:16:13,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-14 16:16:13,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {723#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {723#true} is VALID [2018-11-14 16:16:13,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {723#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {723#true} is VALID [2018-11-14 16:16:13,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {723#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {752#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:16:13,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {752#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {724#false} is VALID [2018-11-14 16:16:13,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {724#false} assume ~p2~0 != 0bv32; {724#false} is VALID [2018-11-14 16:16:13,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {724#false} assume ~lk2~0 != 1bv32; {724#false} is VALID [2018-11-14 16:16:13,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {724#false} assume !false; {724#false} is VALID [2018-11-14 16:16:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:13,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:13,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:13,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:13,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:16:13,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:13,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:13,989 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 16:16:13,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:13,991 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-11-14 16:16:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:14,274 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-11-14 16:16:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:14,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:16:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-14 16:16:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-14 16:16:14,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-14 16:16:14,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:14,498 INFO L225 Difference]: With dead ends: 94 [2018-11-14 16:16:14,498 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 16:16:14,499 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 16:16:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 16:16:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-14 16:16:14,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:14,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-14 16:16:14,544 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-14 16:16:14,545 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-14 16:16:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:14,549 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2018-11-14 16:16:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 107 transitions. [2018-11-14 16:16:14,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:14,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:14,550 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-14 16:16:14,551 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-14 16:16:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:14,554 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2018-11-14 16:16:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 107 transitions. [2018-11-14 16:16:14,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:14,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:14,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:14,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 16:16:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-11-14 16:16:14,560 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-11-14 16:16:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-11-14 16:16:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-14 16:16:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:16:14,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:14,562 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 16:16:14,562 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:14,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-11-14 16:16:14,563 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:14,563 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:14,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:14,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:14,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {1094#true} call ULTIMATE.init(); {1094#true} is VALID [2018-11-14 16:16:14,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {1094#true} assume true; {1094#true} is VALID [2018-11-14 16:16:14,749 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1094#true} {1094#true} #164#return; {1094#true} is VALID [2018-11-14 16:16:14,749 INFO L256 TraceCheckUtils]: 3: Hoare triple {1094#true} call #t~ret9 := main(); {1094#true} is VALID [2018-11-14 16:16:14,749 INFO L273 TraceCheckUtils]: 4: Hoare triple {1094#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1094#true} is VALID [2018-11-14 16:16:14,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {1094#true} assume true; {1094#true} is VALID [2018-11-14 16:16:14,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {1094#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {1094#true} is VALID [2018-11-14 16:16:14,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {1094#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {1094#true} is VALID [2018-11-14 16:16:14,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {1094#true} assume !(~p1~0 != 0bv32); {1094#true} is VALID [2018-11-14 16:16:14,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:14,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1095#false} is VALID [2018-11-14 16:16:14,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {1095#false} assume !false; {1095#false} is VALID [2018-11-14 16:16:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:14,760 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:14,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:14,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:14,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:16:14,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:14,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:14,847 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 16:16:14,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:14,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:14,849 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-11-14 16:16:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,019 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-11-14 16:16:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:15,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:16:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 16:16:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 16:16:15,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-14 16:16:15,151 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 16:16:15,155 INFO L225 Difference]: With dead ends: 117 [2018-11-14 16:16:15,155 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 16:16:15,156 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 16:16:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 16:16:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-11-14 16:16:15,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:15,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 83 states. [2018-11-14 16:16:15,182 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 83 states. [2018-11-14 16:16:15,182 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 83 states. [2018-11-14 16:16:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,187 INFO L93 Difference]: Finished difference Result 115 states and 194 transitions. [2018-11-14 16:16:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 194 transitions. [2018-11-14 16:16:15,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:15,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:15,189 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 115 states. [2018-11-14 16:16:15,189 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 115 states. [2018-11-14 16:16:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,195 INFO L93 Difference]: Finished difference Result 115 states and 194 transitions. [2018-11-14 16:16:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 194 transitions. [2018-11-14 16:16:15,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:15,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:15,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:15,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 16:16:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-11-14 16:16:15,201 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-11-14 16:16:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:15,201 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-11-14 16:16:15,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-11-14 16:16:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:16:15,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:15,202 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 16:16:15,203 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:15,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:15,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-11-14 16:16:15,204 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:15,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:15,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:15,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1606#true} is VALID [2018-11-14 16:16:15,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {1606#true} assume true; {1606#true} is VALID [2018-11-14 16:16:15,328 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1606#true} {1606#true} #164#return; {1606#true} is VALID [2018-11-14 16:16:15,328 INFO L256 TraceCheckUtils]: 3: Hoare triple {1606#true} call #t~ret9 := main(); {1606#true} is VALID [2018-11-14 16:16:15,328 INFO L273 TraceCheckUtils]: 4: Hoare triple {1606#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {1606#true} is VALID [2018-11-14 16:16:15,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {1606#true} assume true; {1606#true} is VALID [2018-11-14 16:16:15,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {1606#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {1606#true} is VALID [2018-11-14 16:16:15,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {1606#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {1606#true} is VALID [2018-11-14 16:16:15,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {1606#true} assume !(~p1~0 != 0bv32); {1606#true} is VALID [2018-11-14 16:16:15,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {1606#true} assume !(~p2~0 != 0bv32); {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {1638#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:16:15,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {1638#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {1607#false} is VALID [2018-11-14 16:16:15,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {1607#false} assume ~lk2~0 != 1bv32; {1607#false} is VALID [2018-11-14 16:16:15,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2018-11-14 16:16:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:15,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:15,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:15,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:15,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:16:15,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:15,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:15,400 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 16:16:15,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:15,401 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-11-14 16:16:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,583 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-11-14 16:16:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:15,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 16:16:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-14 16:16:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-14 16:16:15,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-14 16:16:15,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:15,906 INFO L225 Difference]: With dead ends: 191 [2018-11-14 16:16:15,906 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 16:16:15,907 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 16:16:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 16:16:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-14 16:16:15,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:15,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-14 16:16:15,947 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-14 16:16:15,947 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-14 16:16:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,953 INFO L93 Difference]: Finished difference Result 117 states and 192 transitions. [2018-11-14 16:16:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 192 transitions. [2018-11-14 16:16:15,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:15,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:15,954 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-14 16:16:15,954 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-14 16:16:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:15,959 INFO L93 Difference]: Finished difference Result 117 states and 192 transitions. [2018-11-14 16:16:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 192 transitions. [2018-11-14 16:16:15,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:15,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:15,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:15,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 16:16:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-11-14 16:16:15,965 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-11-14 16:16:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:15,966 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-11-14 16:16:15,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-11-14 16:16:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:16:15,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:15,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:15,967 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:15,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-11-14 16:16:15,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:15,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:16,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:16,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {2232#true} call ULTIMATE.init(); {2232#true} is VALID [2018-11-14 16:16:16,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {2232#true} assume true; {2232#true} is VALID [2018-11-14 16:16:16,064 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2232#true} {2232#true} #164#return; {2232#true} is VALID [2018-11-14 16:16:16,064 INFO L256 TraceCheckUtils]: 3: Hoare triple {2232#true} call #t~ret9 := main(); {2232#true} is VALID [2018-11-14 16:16:16,064 INFO L273 TraceCheckUtils]: 4: Hoare triple {2232#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {2232#true} is VALID [2018-11-14 16:16:16,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {2232#true} assume true; {2232#true} is VALID [2018-11-14 16:16:16,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {2232#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {2232#true} is VALID [2018-11-14 16:16:16,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {2232#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {2232#true} is VALID [2018-11-14 16:16:16,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {2232#true} assume !(~p1~0 != 0bv32); {2232#true} is VALID [2018-11-14 16:16:16,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {2232#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {2264#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:16:16,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {2264#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {2233#false} is VALID [2018-11-14 16:16:16,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {2233#false} assume ~p3~0 != 0bv32; {2233#false} is VALID [2018-11-14 16:16:16,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {2233#false} assume ~lk3~0 != 1bv32; {2233#false} is VALID [2018-11-14 16:16:16,077 INFO L273 TraceCheckUtils]: 20: Hoare triple {2233#false} assume !false; {2233#false} is VALID [2018-11-14 16:16:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:16,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:16,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:16,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:16,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:16:16,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:16,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:16,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:16,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:16,106 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-11-14 16:16:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,268 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-11-14 16:16:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:16,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:16:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-14 16:16:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-14 16:16:16,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-14 16:16:16,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:16,497 INFO L225 Difference]: With dead ends: 172 [2018-11-14 16:16:16,498 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 16:16:16,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 16:16:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-14 16:16:16,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:16,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 117 states. [2018-11-14 16:16:16,541 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 117 states. [2018-11-14 16:16:16,542 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 117 states. [2018-11-14 16:16:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,546 INFO L93 Difference]: Finished difference Result 119 states and 192 transitions. [2018-11-14 16:16:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2018-11-14 16:16:16,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:16,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:16,547 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 119 states. [2018-11-14 16:16:16,547 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 119 states. [2018-11-14 16:16:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,551 INFO L93 Difference]: Finished difference Result 119 states and 192 transitions. [2018-11-14 16:16:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2018-11-14 16:16:16,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:16,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:16,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:16,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-14 16:16:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-11-14 16:16:16,556 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-11-14 16:16:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:16,556 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-11-14 16:16:16,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-11-14 16:16:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:16:16,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:16,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:16,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:16,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-11-14 16:16:16,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:16,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:16,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {2848#true} call ULTIMATE.init(); {2848#true} is VALID [2018-11-14 16:16:16,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {2848#true} assume true; {2848#true} is VALID [2018-11-14 16:16:16,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2848#true} {2848#true} #164#return; {2848#true} is VALID [2018-11-14 16:16:16,672 INFO L256 TraceCheckUtils]: 3: Hoare triple {2848#true} call #t~ret9 := main(); {2848#true} is VALID [2018-11-14 16:16:16,672 INFO L273 TraceCheckUtils]: 4: Hoare triple {2848#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {2848#true} is VALID [2018-11-14 16:16:16,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {2848#true} assume true; {2848#true} is VALID [2018-11-14 16:16:16,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {2848#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {2848#true} is VALID [2018-11-14 16:16:16,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {2848#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {2848#true} is VALID [2018-11-14 16:16:16,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {2848#true} assume !(~p1~0 != 0bv32); {2848#true} is VALID [2018-11-14 16:16:16,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {2848#true} assume !(~p2~0 != 0bv32); {2848#true} is VALID [2018-11-14 16:16:16,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {2848#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:16,714 INFO L273 TraceCheckUtils]: 19: Hoare triple {2883#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {2849#false} is VALID [2018-11-14 16:16:16,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {2849#false} assume !false; {2849#false} is VALID [2018-11-14 16:16:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:16,715 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:16,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:16,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:16,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:16:16,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:16,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:16,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:16,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:16,769 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-11-14 16:16:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,994 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-11-14 16:16:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:16,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:16:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2018-11-14 16:16:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2018-11-14 16:16:16,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 100 transitions. [2018-11-14 16:16:17,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:17,432 INFO L225 Difference]: With dead ends: 213 [2018-11-14 16:16:17,433 INFO L226 Difference]: Without dead ends: 211 [2018-11-14 16:16:17,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-14 16:16:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-11-14 16:16:17,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:17,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 157 states. [2018-11-14 16:16:17,541 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 157 states. [2018-11-14 16:16:17,541 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 157 states. [2018-11-14 16:16:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:17,548 INFO L93 Difference]: Finished difference Result 211 states and 348 transitions. [2018-11-14 16:16:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 348 transitions. [2018-11-14 16:16:17,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:17,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:17,550 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 211 states. [2018-11-14 16:16:17,550 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 211 states. [2018-11-14 16:16:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:17,559 INFO L93 Difference]: Finished difference Result 211 states and 348 transitions. [2018-11-14 16:16:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 348 transitions. [2018-11-14 16:16:17,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:17,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:17,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:17,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-14 16:16:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-11-14 16:16:17,567 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-11-14 16:16:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:17,567 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-11-14 16:16:17,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-11-14 16:16:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:16:17,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:17,568 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:17,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:17,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-11-14 16:16:17,569 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:17,570 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:17,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:17,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:17,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {3731#true} call ULTIMATE.init(); {3731#true} is VALID [2018-11-14 16:16:17,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {3731#true} assume true; {3731#true} is VALID [2018-11-14 16:16:17,936 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3731#true} {3731#true} #164#return; {3731#true} is VALID [2018-11-14 16:16:17,936 INFO L256 TraceCheckUtils]: 3: Hoare triple {3731#true} call #t~ret9 := main(); {3731#true} is VALID [2018-11-14 16:16:17,936 INFO L273 TraceCheckUtils]: 4: Hoare triple {3731#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {3731#true} is VALID [2018-11-14 16:16:17,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {3731#true} assume true; {3731#true} is VALID [2018-11-14 16:16:17,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {3731#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {3731#true} is VALID [2018-11-14 16:16:17,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {3731#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {3731#true} is VALID [2018-11-14 16:16:17,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {3731#true} assume !(~p1~0 != 0bv32); {3731#true} is VALID [2018-11-14 16:16:17,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {3731#true} assume !(~p2~0 != 0bv32); {3731#true} is VALID [2018-11-14 16:16:17,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {3731#true} assume !(~p3~0 != 0bv32); {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {3766#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:16:17,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {3766#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {3732#false} is VALID [2018-11-14 16:16:17,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {3732#false} assume ~lk3~0 != 1bv32; {3732#false} is VALID [2018-11-14 16:16:17,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {3732#false} assume !false; {3732#false} is VALID [2018-11-14 16:16:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:17,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:17,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:17,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:17,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:16:17,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:17,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:17,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:17,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:17,977 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-11-14 16:16:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:18,195 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-11-14 16:16:18,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:18,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:16:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 16:16:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 16:16:18,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-14 16:16:18,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:18,420 INFO L225 Difference]: With dead ends: 365 [2018-11-14 16:16:18,420 INFO L226 Difference]: Without dead ends: 219 [2018-11-14 16:16:18,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-14 16:16:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-14 16:16:18,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:18,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 217 states. [2018-11-14 16:16:18,486 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 217 states. [2018-11-14 16:16:18,486 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 217 states. [2018-11-14 16:16:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:18,494 INFO L93 Difference]: Finished difference Result 219 states and 348 transitions. [2018-11-14 16:16:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2018-11-14 16:16:18,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:18,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:18,495 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 219 states. [2018-11-14 16:16:18,495 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 219 states. [2018-11-14 16:16:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:18,503 INFO L93 Difference]: Finished difference Result 219 states and 348 transitions. [2018-11-14 16:16:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2018-11-14 16:16:18,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:18,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:18,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:18,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-14 16:16:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-11-14 16:16:18,512 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-11-14 16:16:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:18,512 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-11-14 16:16:18,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-11-14 16:16:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:16:18,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:18,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:18,513 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:18,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-11-14 16:16:18,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:18,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:18,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:18,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:18,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {4850#true} call ULTIMATE.init(); {4850#true} is VALID [2018-11-14 16:16:18,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {4850#true} assume true; {4850#true} is VALID [2018-11-14 16:16:18,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4850#true} {4850#true} #164#return; {4850#true} is VALID [2018-11-14 16:16:18,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {4850#true} call #t~ret9 := main(); {4850#true} is VALID [2018-11-14 16:16:18,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {4850#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {4850#true} is VALID [2018-11-14 16:16:18,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {4850#true} assume true; {4850#true} is VALID [2018-11-14 16:16:18,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {4850#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {4850#true} is VALID [2018-11-14 16:16:18,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {4850#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {4850#true} is VALID [2018-11-14 16:16:18,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {4850#true} assume !(~p1~0 != 0bv32); {4850#true} is VALID [2018-11-14 16:16:18,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {4850#true} assume !(~p2~0 != 0bv32); {4850#true} is VALID [2018-11-14 16:16:18,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {4850#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {4885#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:16:18,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {4885#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {4851#false} is VALID [2018-11-14 16:16:18,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {4851#false} assume ~p4~0 != 0bv32; {4851#false} is VALID [2018-11-14 16:16:18,656 INFO L273 TraceCheckUtils]: 20: Hoare triple {4851#false} assume ~lk4~0 != 1bv32; {4851#false} is VALID [2018-11-14 16:16:18,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {4851#false} assume !false; {4851#false} is VALID [2018-11-14 16:16:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:18,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:18,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:18,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:18,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:16:18,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:18,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:18,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:18,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:18,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:18,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:18,689 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-11-14 16:16:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:19,220 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-14 16:16:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:19,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:16:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-14 16:16:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-14 16:16:19,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-14 16:16:19,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:19,675 INFO L225 Difference]: With dead ends: 325 [2018-11-14 16:16:19,675 INFO L226 Difference]: Without dead ends: 223 [2018-11-14 16:16:19,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-14 16:16:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-14 16:16:19,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:19,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand 221 states. [2018-11-14 16:16:19,754 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 221 states. [2018-11-14 16:16:19,754 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 221 states. [2018-11-14 16:16:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:19,759 INFO L93 Difference]: Finished difference Result 223 states and 348 transitions. [2018-11-14 16:16:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 348 transitions. [2018-11-14 16:16:19,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:19,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:19,761 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 223 states. [2018-11-14 16:16:19,761 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 223 states. [2018-11-14 16:16:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:19,767 INFO L93 Difference]: Finished difference Result 223 states and 348 transitions. [2018-11-14 16:16:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 348 transitions. [2018-11-14 16:16:19,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:19,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:19,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:19,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-14 16:16:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-11-14 16:16:19,774 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-11-14 16:16:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:19,774 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-11-14 16:16:19,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-11-14 16:16:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:16:19,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:19,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:19,775 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:19,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-11-14 16:16:19,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:19,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:19,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:20,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {5944#true} call ULTIMATE.init(); {5944#true} is VALID [2018-11-14 16:16:20,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {5944#true} assume true; {5944#true} is VALID [2018-11-14 16:16:20,243 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5944#true} {5944#true} #164#return; {5944#true} is VALID [2018-11-14 16:16:20,243 INFO L256 TraceCheckUtils]: 3: Hoare triple {5944#true} call #t~ret9 := main(); {5944#true} is VALID [2018-11-14 16:16:20,244 INFO L273 TraceCheckUtils]: 4: Hoare triple {5944#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {5944#true} is VALID [2018-11-14 16:16:20,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {5944#true} assume true; {5944#true} is VALID [2018-11-14 16:16:20,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {5944#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {5944#true} is VALID [2018-11-14 16:16:20,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {5944#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {5944#true} is VALID [2018-11-14 16:16:20,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {5944#true} assume !(~p1~0 != 0bv32); {5944#true} is VALID [2018-11-14 16:16:20,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {5944#true} assume !(~p2~0 != 0bv32); {5944#true} is VALID [2018-11-14 16:16:20,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {5944#true} assume !(~p3~0 != 0bv32); {5944#true} is VALID [2018-11-14 16:16:20,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {5944#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,258 INFO L273 TraceCheckUtils]: 19: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:20,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {5982#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {5945#false} is VALID [2018-11-14 16:16:20,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {5945#false} assume !false; {5945#false} is VALID [2018-11-14 16:16:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:20,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:20,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:20,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:16:20,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:20,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:20,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:20,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:20,293 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-11-14 16:16:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:20,615 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-11-14 16:16:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:20,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:16:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-14 16:16:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2018-11-14 16:16:20,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2018-11-14 16:16:21,066 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 16:16:21,079 INFO L225 Difference]: With dead ends: 397 [2018-11-14 16:16:21,079 INFO L226 Difference]: Without dead ends: 395 [2018-11-14 16:16:21,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-14 16:16:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-11-14 16:16:21,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:21,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand 305 states. [2018-11-14 16:16:21,197 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand 305 states. [2018-11-14 16:16:21,197 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 305 states. [2018-11-14 16:16:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:21,210 INFO L93 Difference]: Finished difference Result 395 states and 624 transitions. [2018-11-14 16:16:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2018-11-14 16:16:21,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:21,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:21,212 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand 395 states. [2018-11-14 16:16:21,212 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 395 states. [2018-11-14 16:16:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:21,226 INFO L93 Difference]: Finished difference Result 395 states and 624 transitions. [2018-11-14 16:16:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2018-11-14 16:16:21,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:21,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:21,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:21,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-14 16:16:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-11-14 16:16:21,238 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-11-14 16:16:21,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:21,239 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-11-14 16:16:21,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-11-14 16:16:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:16:21,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:21,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:21,241 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:21,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-11-14 16:16:21,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:21,241 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:21,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:21,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:21,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {7542#true} call ULTIMATE.init(); {7542#true} is VALID [2018-11-14 16:16:21,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {7542#true} assume true; {7542#true} is VALID [2018-11-14 16:16:21,647 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7542#true} {7542#true} #164#return; {7542#true} is VALID [2018-11-14 16:16:21,647 INFO L256 TraceCheckUtils]: 3: Hoare triple {7542#true} call #t~ret9 := main(); {7542#true} is VALID [2018-11-14 16:16:21,647 INFO L273 TraceCheckUtils]: 4: Hoare triple {7542#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {7542#true} is VALID [2018-11-14 16:16:21,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {7542#true} assume true; {7542#true} is VALID [2018-11-14 16:16:21,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {7542#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {7542#true} is VALID [2018-11-14 16:16:21,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {7542#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {7542#true} is VALID [2018-11-14 16:16:21,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {7542#true} assume !(~p1~0 != 0bv32); {7542#true} is VALID [2018-11-14 16:16:21,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {7542#true} assume !(~p2~0 != 0bv32); {7542#true} is VALID [2018-11-14 16:16:21,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {7542#true} assume !(~p3~0 != 0bv32); {7542#true} is VALID [2018-11-14 16:16:21,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {7542#true} assume !(~p4~0 != 0bv32); {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {7580#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:16:21,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {7580#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {7543#false} is VALID [2018-11-14 16:16:21,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {7543#false} assume ~lk4~0 != 1bv32; {7543#false} is VALID [2018-11-14 16:16:21,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {7543#false} assume !false; {7543#false} is VALID [2018-11-14 16:16:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:21,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:21,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:21,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:16:21,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:21,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:21,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:21,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:21,678 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-11-14 16:16:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:22,238 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-11-14 16:16:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:22,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:16:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-14 16:16:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-14 16:16:22,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-14 16:16:22,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:22,941 INFO L225 Difference]: With dead ends: 709 [2018-11-14 16:16:22,941 INFO L226 Difference]: Without dead ends: 419 [2018-11-14 16:16:22,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-14 16:16:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-11-14 16:16:23,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:23,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand 417 states. [2018-11-14 16:16:23,325 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand 417 states. [2018-11-14 16:16:23,325 INFO L87 Difference]: Start difference. First operand 419 states. Second operand 417 states. [2018-11-14 16:16:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:23,339 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2018-11-14 16:16:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-11-14 16:16:23,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:23,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:23,340 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand 419 states. [2018-11-14 16:16:23,340 INFO L87 Difference]: Start difference. First operand 417 states. Second operand 419 states. [2018-11-14 16:16:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:23,353 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2018-11-14 16:16:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-11-14 16:16:23,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:23,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:23,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:23,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-14 16:16:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-11-14 16:16:23,368 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-11-14 16:16:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-11-14 16:16:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-11-14 16:16:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:16:23,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:23,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:23,370 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:23,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-11-14 16:16:23,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:23,370 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:23,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:23,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:23,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {9628#true} call ULTIMATE.init(); {9628#true} is VALID [2018-11-14 16:16:23,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {9628#true} assume true; {9628#true} is VALID [2018-11-14 16:16:23,924 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9628#true} {9628#true} #164#return; {9628#true} is VALID [2018-11-14 16:16:23,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {9628#true} call #t~ret9 := main(); {9628#true} is VALID [2018-11-14 16:16:23,925 INFO L273 TraceCheckUtils]: 4: Hoare triple {9628#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {9628#true} is VALID [2018-11-14 16:16:23,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {9628#true} assume true; {9628#true} is VALID [2018-11-14 16:16:23,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {9628#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {9628#true} is VALID [2018-11-14 16:16:23,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {9628#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {9628#true} is VALID [2018-11-14 16:16:23,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {9628#true} assume !(~p1~0 != 0bv32); {9628#true} is VALID [2018-11-14 16:16:23,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {9628#true} assume !(~p2~0 != 0bv32); {9628#true} is VALID [2018-11-14 16:16:23,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {9628#true} assume !(~p3~0 != 0bv32); {9628#true} is VALID [2018-11-14 16:16:23,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {9628#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {9666#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:16:23,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {9666#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {9629#false} is VALID [2018-11-14 16:16:23,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {9629#false} assume ~p5~0 != 0bv32; {9629#false} is VALID [2018-11-14 16:16:23,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {9629#false} assume ~lk5~0 != 1bv32; {9629#false} is VALID [2018-11-14 16:16:23,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {9629#false} assume !false; {9629#false} is VALID [2018-11-14 16:16:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:23,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:23,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:16:23,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:23,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:23,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:23,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:23,986 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-11-14 16:16:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:24,411 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-11-14 16:16:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:24,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:16:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 16:16:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-14 16:16:24,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-14 16:16:25,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:25,192 INFO L225 Difference]: With dead ends: 625 [2018-11-14 16:16:25,192 INFO L226 Difference]: Without dead ends: 427 [2018-11-14 16:16:25,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-14 16:16:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-11-14 16:16:25,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:25,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand 425 states. [2018-11-14 16:16:25,422 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand 425 states. [2018-11-14 16:16:25,422 INFO L87 Difference]: Start difference. First operand 427 states. Second operand 425 states. [2018-11-14 16:16:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:25,439 INFO L93 Difference]: Finished difference Result 427 states and 632 transitions. [2018-11-14 16:16:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 632 transitions. [2018-11-14 16:16:25,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:25,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:25,441 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand 427 states. [2018-11-14 16:16:25,441 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 427 states. [2018-11-14 16:16:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:25,457 INFO L93 Difference]: Finished difference Result 427 states and 632 transitions. [2018-11-14 16:16:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 632 transitions. [2018-11-14 16:16:25,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:25,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:25,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:25,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-14 16:16:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-11-14 16:16:25,474 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-11-14 16:16:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:25,475 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-11-14 16:16:25,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-11-14 16:16:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:16:25,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:25,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:25,477 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:25,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-11-14 16:16:25,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:25,478 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:25,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:25,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:25,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {11657#true} call ULTIMATE.init(); {11657#true} is VALID [2018-11-14 16:16:25,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {11657#true} assume true; {11657#true} is VALID [2018-11-14 16:16:25,964 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11657#true} {11657#true} #164#return; {11657#true} is VALID [2018-11-14 16:16:25,964 INFO L256 TraceCheckUtils]: 3: Hoare triple {11657#true} call #t~ret9 := main(); {11657#true} is VALID [2018-11-14 16:16:25,964 INFO L273 TraceCheckUtils]: 4: Hoare triple {11657#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {11657#true} is VALID [2018-11-14 16:16:25,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {11657#true} assume true; {11657#true} is VALID [2018-11-14 16:16:25,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {11657#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {11657#true} is VALID [2018-11-14 16:16:25,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {11657#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {11657#true} is VALID [2018-11-14 16:16:25,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {11657#true} assume !(~p1~0 != 0bv32); {11657#true} is VALID [2018-11-14 16:16:25,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {11657#true} assume !(~p2~0 != 0bv32); {11657#true} is VALID [2018-11-14 16:16:25,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {11657#true} assume !(~p3~0 != 0bv32); {11657#true} is VALID [2018-11-14 16:16:25,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {11657#true} assume !(~p4~0 != 0bv32); {11657#true} is VALID [2018-11-14 16:16:25,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {11657#true} assume !(~p5~0 != 0bv32); {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {11698#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:16:25,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {11698#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {11658#false} is VALID [2018-11-14 16:16:25,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {11658#false} assume ~lk5~0 != 1bv32; {11658#false} is VALID [2018-11-14 16:16:25,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {11658#false} assume !false; {11658#false} is VALID [2018-11-14 16:16:25,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 16:16:25,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:25,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:25,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:25,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:16:25,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:25,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:26,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:26,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:26,006 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-11-14 16:16:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:26,516 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-11-14 16:16:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:26,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:16:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-14 16:16:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-14 16:16:26,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-14 16:16:27,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:27,101 INFO L225 Difference]: With dead ends: 1213 [2018-11-14 16:16:27,101 INFO L226 Difference]: Without dead ends: 811 [2018-11-14 16:16:27,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-14 16:16:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-11-14 16:16:27,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:27,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 811 states. Second operand 809 states. [2018-11-14 16:16:27,372 INFO L74 IsIncluded]: Start isIncluded. First operand 811 states. Second operand 809 states. [2018-11-14 16:16:27,373 INFO L87 Difference]: Start difference. First operand 811 states. Second operand 809 states. [2018-11-14 16:16:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:27,406 INFO L93 Difference]: Finished difference Result 811 states and 1160 transitions. [2018-11-14 16:16:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1160 transitions. [2018-11-14 16:16:27,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:27,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:27,408 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand 811 states. [2018-11-14 16:16:27,408 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 811 states. [2018-11-14 16:16:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:27,444 INFO L93 Difference]: Finished difference Result 811 states and 1160 transitions. [2018-11-14 16:16:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1160 transitions. [2018-11-14 16:16:27,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:27,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:27,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:27,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-14 16:16:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-11-14 16:16:27,485 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-11-14 16:16:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:27,485 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-11-14 16:16:27,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-11-14 16:16:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:16:27,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:27,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:27,487 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:27,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-11-14 16:16:27,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:27,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:27,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:27,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {15466#true} call ULTIMATE.init(); {15466#true} is VALID [2018-11-14 16:16:27,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {15466#true} assume true; {15466#true} is VALID [2018-11-14 16:16:27,659 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15466#true} {15466#true} #164#return; {15466#true} is VALID [2018-11-14 16:16:27,660 INFO L256 TraceCheckUtils]: 3: Hoare triple {15466#true} call #t~ret9 := main(); {15466#true} is VALID [2018-11-14 16:16:27,660 INFO L273 TraceCheckUtils]: 4: Hoare triple {15466#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {15466#true} is VALID [2018-11-14 16:16:27,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {15466#true} assume true; {15466#true} is VALID [2018-11-14 16:16:27,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {15466#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {15466#true} is VALID [2018-11-14 16:16:27,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {15466#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {15466#true} is VALID [2018-11-14 16:16:27,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {15466#true} assume !(~p1~0 != 0bv32); {15466#true} is VALID [2018-11-14 16:16:27,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {15466#true} assume !(~p2~0 != 0bv32); {15466#true} is VALID [2018-11-14 16:16:27,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {15466#true} assume !(~p3~0 != 0bv32); {15466#true} is VALID [2018-11-14 16:16:27,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {15466#true} assume !(~p4~0 != 0bv32); {15466#true} is VALID [2018-11-14 16:16:27,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {15466#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:27,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {15507#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {15467#false} is VALID [2018-11-14 16:16:27,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {15467#false} assume !false; {15467#false} is VALID [2018-11-14 16:16:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:27,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:27,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:27,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:27,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:16:27,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:27,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:27,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:27,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:27,744 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-11-14 16:16:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:28,573 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-11-14 16:16:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:28,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:16:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-14 16:16:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2018-11-14 16:16:28,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2018-11-14 16:16:28,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:28,727 INFO L225 Difference]: With dead ends: 957 [2018-11-14 16:16:28,728 INFO L226 Difference]: Without dead ends: 955 [2018-11-14 16:16:28,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-14 16:16:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-11-14 16:16:29,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:29,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 955 states. Second operand 809 states. [2018-11-14 16:16:29,864 INFO L74 IsIncluded]: Start isIncluded. First operand 955 states. Second operand 809 states. [2018-11-14 16:16:29,864 INFO L87 Difference]: Start difference. First operand 955 states. Second operand 809 states. [2018-11-14 16:16:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:29,905 INFO L93 Difference]: Finished difference Result 955 states and 1384 transitions. [2018-11-14 16:16:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1384 transitions. [2018-11-14 16:16:29,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:29,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:29,908 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand 955 states. [2018-11-14 16:16:29,908 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 955 states. [2018-11-14 16:16:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:29,955 INFO L93 Difference]: Finished difference Result 955 states and 1384 transitions. [2018-11-14 16:16:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1384 transitions. [2018-11-14 16:16:29,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:29,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:29,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:29,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-14 16:16:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-11-14 16:16:29,993 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-11-14 16:16:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:29,994 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-11-14 16:16:29,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-11-14 16:16:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:16:29,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:29,995 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:29,995 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:29,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-11-14 16:16:29,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:29,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:30,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:30,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:30,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {19307#true} call ULTIMATE.init(); {19307#true} is VALID [2018-11-14 16:16:30,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {19307#true} assume true; {19307#true} is VALID [2018-11-14 16:16:30,107 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19307#true} {19307#true} #164#return; {19307#true} is VALID [2018-11-14 16:16:30,107 INFO L256 TraceCheckUtils]: 3: Hoare triple {19307#true} call #t~ret9 := main(); {19307#true} is VALID [2018-11-14 16:16:30,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {19307#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {19307#true} is VALID [2018-11-14 16:16:30,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {19307#true} assume true; {19307#true} is VALID [2018-11-14 16:16:30,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {19307#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {19307#true} is VALID [2018-11-14 16:16:30,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {19307#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {19307#true} is VALID [2018-11-14 16:16:30,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {19307#true} assume !(~p1~0 != 0bv32); {19307#true} is VALID [2018-11-14 16:16:30,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {19307#true} assume !(~p2~0 != 0bv32); {19307#true} is VALID [2018-11-14 16:16:30,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {19307#true} assume !(~p3~0 != 0bv32); {19307#true} is VALID [2018-11-14 16:16:30,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {19307#true} assume !(~p4~0 != 0bv32); {19307#true} is VALID [2018-11-14 16:16:30,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {19307#true} assume !(~p5~0 != 0bv32); {19307#true} is VALID [2018-11-14 16:16:30,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {19307#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:30,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {19351#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {19308#false} is VALID [2018-11-14 16:16:30,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {19308#false} assume !false; {19308#false} is VALID [2018-11-14 16:16:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:30,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:30,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:30,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:30,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:16:30,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:30,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:30,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:30,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:30,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:30,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:30,145 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-11-14 16:16:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:31,078 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-11-14 16:16:31,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:31,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:16:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 16:16:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-14 16:16:31,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-14 16:16:31,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:31,254 INFO L225 Difference]: With dead ends: 1405 [2018-11-14 16:16:31,255 INFO L226 Difference]: Without dead ends: 1403 [2018-11-14 16:16:31,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-11-14 16:16:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-11-14 16:16:31,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:31,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1403 states. Second operand 1177 states. [2018-11-14 16:16:31,909 INFO L74 IsIncluded]: Start isIncluded. First operand 1403 states. Second operand 1177 states. [2018-11-14 16:16:31,909 INFO L87 Difference]: Start difference. First operand 1403 states. Second operand 1177 states. [2018-11-14 16:16:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:31,974 INFO L93 Difference]: Finished difference Result 1403 states and 1976 transitions. [2018-11-14 16:16:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1976 transitions. [2018-11-14 16:16:31,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:31,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:31,976 INFO L74 IsIncluded]: Start isIncluded. First operand 1177 states. Second operand 1403 states. [2018-11-14 16:16:31,976 INFO L87 Difference]: Start difference. First operand 1177 states. Second operand 1403 states. [2018-11-14 16:16:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:32,039 INFO L93 Difference]: Finished difference Result 1403 states and 1976 transitions. [2018-11-14 16:16:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1976 transitions. [2018-11-14 16:16:32,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:32,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:32,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:32,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-14 16:16:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-11-14 16:16:32,099 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-11-14 16:16:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:32,100 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-11-14 16:16:32,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-11-14 16:16:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:16:32,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:32,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:32,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:32,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:32,102 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-11-14 16:16:32,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:32,103 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:32,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:32,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:32,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {24879#true} call ULTIMATE.init(); {24879#true} is VALID [2018-11-14 16:16:32,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {24879#true} assume true; {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24879#true} {24879#true} #164#return; {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L256 TraceCheckUtils]: 3: Hoare triple {24879#true} call #t~ret9 := main(); {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L273 TraceCheckUtils]: 4: Hoare triple {24879#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {24879#true} assume true; {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {24879#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {24879#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {24879#true} is VALID [2018-11-14 16:16:32,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {24879#true} assume !(~p1~0 != 0bv32); {24879#true} is VALID [2018-11-14 16:16:32,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {24879#true} assume !(~p2~0 != 0bv32); {24879#true} is VALID [2018-11-14 16:16:32,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {24879#true} assume !(~p3~0 != 0bv32); {24879#true} is VALID [2018-11-14 16:16:32,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {24879#true} assume !(~p4~0 != 0bv32); {24879#true} is VALID [2018-11-14 16:16:32,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {24879#true} assume !(~p5~0 != 0bv32); {24879#true} is VALID [2018-11-14 16:16:32,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {24879#true} assume !(~p6~0 != 0bv32); {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {24923#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:16:32,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {24923#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {24880#false} is VALID [2018-11-14 16:16:32,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {24880#false} assume ~lk6~0 != 1bv32; {24880#false} is VALID [2018-11-14 16:16:32,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {24880#false} assume !false; {24880#false} is VALID [2018-11-14 16:16:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:32,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:32,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:32,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:16:32,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:32,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:32,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:32,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:32,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:32,230 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-11-14 16:16:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:33,114 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-11-14 16:16:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:33,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:16:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-14 16:16:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-14 16:16:33,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2018-11-14 16:16:33,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:33,400 INFO L225 Difference]: With dead ends: 2717 [2018-11-14 16:16:33,400 INFO L226 Difference]: Without dead ends: 1563 [2018-11-14 16:16:33,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-11-14 16:16:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-11-14 16:16:34,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:34,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1563 states. Second operand 1561 states. [2018-11-14 16:16:34,085 INFO L74 IsIncluded]: Start isIncluded. First operand 1563 states. Second operand 1561 states. [2018-11-14 16:16:34,085 INFO L87 Difference]: Start difference. First operand 1563 states. Second operand 1561 states. [2018-11-14 16:16:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:34,174 INFO L93 Difference]: Finished difference Result 1563 states and 2088 transitions. [2018-11-14 16:16:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2088 transitions. [2018-11-14 16:16:34,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:34,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:34,176 INFO L74 IsIncluded]: Start isIncluded. First operand 1561 states. Second operand 1563 states. [2018-11-14 16:16:34,176 INFO L87 Difference]: Start difference. First operand 1561 states. Second operand 1563 states. [2018-11-14 16:16:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:34,265 INFO L93 Difference]: Finished difference Result 1563 states and 2088 transitions. [2018-11-14 16:16:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2088 transitions. [2018-11-14 16:16:34,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:34,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:34,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:34,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-14 16:16:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-11-14 16:16:34,350 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-11-14 16:16:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:34,351 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-11-14 16:16:34,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-11-14 16:16:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:16:34,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:34,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:34,352 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:34,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-11-14 16:16:34,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:34,353 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:34,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:34,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {32531#true} call ULTIMATE.init(); {32531#true} is VALID [2018-11-14 16:16:34,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {32531#true} assume true; {32531#true} is VALID [2018-11-14 16:16:34,435 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32531#true} {32531#true} #164#return; {32531#true} is VALID [2018-11-14 16:16:34,435 INFO L256 TraceCheckUtils]: 3: Hoare triple {32531#true} call #t~ret9 := main(); {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 4: Hoare triple {32531#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {32531#true} assume true; {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {32531#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {32531#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {32531#true} assume !(~p1~0 != 0bv32); {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {32531#true} assume !(~p2~0 != 0bv32); {32531#true} is VALID [2018-11-14 16:16:34,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {32531#true} assume !(~p3~0 != 0bv32); {32531#true} is VALID [2018-11-14 16:16:34,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {32531#true} assume !(~p4~0 != 0bv32); {32531#true} is VALID [2018-11-14 16:16:34,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {32531#true} assume !(~p5~0 != 0bv32); {32531#true} is VALID [2018-11-14 16:16:34,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {32531#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {32575#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:16:34,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {32575#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {32532#false} is VALID [2018-11-14 16:16:34,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {32532#false} assume ~p7~0 != 0bv32; {32532#false} is VALID [2018-11-14 16:16:34,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {32532#false} assume ~lk7~0 != 1bv32; {32532#false} is VALID [2018-11-14 16:16:34,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {32532#false} assume !false; {32532#false} is VALID [2018-11-14 16:16:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:34,452 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:34,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:34,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:34,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:34,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:34,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:34,476 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-11-14 16:16:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:35,678 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-11-14 16:16:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:35,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-14 16:16:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-14 16:16:35,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-14 16:16:35,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:35,934 INFO L225 Difference]: With dead ends: 2365 [2018-11-14 16:16:35,934 INFO L226 Difference]: Without dead ends: 1611 [2018-11-14 16:16:35,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-14 16:16:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-11-14 16:16:37,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:37,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand 1609 states. [2018-11-14 16:16:37,211 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand 1609 states. [2018-11-14 16:16:37,211 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand 1609 states. [2018-11-14 16:16:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:37,296 INFO L93 Difference]: Finished difference Result 1611 states and 2120 transitions. [2018-11-14 16:16:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2120 transitions. [2018-11-14 16:16:37,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:37,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:37,299 INFO L74 IsIncluded]: Start isIncluded. First operand 1609 states. Second operand 1611 states. [2018-11-14 16:16:37,299 INFO L87 Difference]: Start difference. First operand 1609 states. Second operand 1611 states. [2018-11-14 16:16:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:37,396 INFO L93 Difference]: Finished difference Result 1611 states and 2120 transitions. [2018-11-14 16:16:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2120 transitions. [2018-11-14 16:16:37,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:37,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:37,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:37,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-14 16:16:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-11-14 16:16:37,483 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-11-14 16:16:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:37,483 INFO L480 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-11-14 16:16:37,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-11-14 16:16:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:16:37,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:37,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:37,485 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:37,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-11-14 16:16:37,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:37,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:37,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:37,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:37,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39978#true} is VALID [2018-11-14 16:16:37,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {39978#true} assume true; {39978#true} is VALID [2018-11-14 16:16:37,583 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {39978#true} {39978#true} #164#return; {39978#true} is VALID [2018-11-14 16:16:37,584 INFO L256 TraceCheckUtils]: 3: Hoare triple {39978#true} call #t~ret9 := main(); {39978#true} is VALID [2018-11-14 16:16:37,584 INFO L273 TraceCheckUtils]: 4: Hoare triple {39978#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {39978#true} is VALID [2018-11-14 16:16:37,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {39978#true} assume true; {39978#true} is VALID [2018-11-14 16:16:37,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {39978#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {39978#true} is VALID [2018-11-14 16:16:37,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {39978#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {39978#true} is VALID [2018-11-14 16:16:37,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {39978#true} assume !(~p1~0 != 0bv32); {39978#true} is VALID [2018-11-14 16:16:37,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {39978#true} assume !(~p2~0 != 0bv32); {39978#true} is VALID [2018-11-14 16:16:37,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {39978#true} assume !(~p3~0 != 0bv32); {39978#true} is VALID [2018-11-14 16:16:37,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {39978#true} assume !(~p4~0 != 0bv32); {39978#true} is VALID [2018-11-14 16:16:37,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {39978#true} assume !(~p5~0 != 0bv32); {39978#true} is VALID [2018-11-14 16:16:37,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {39978#true} assume !(~p6~0 != 0bv32); {39978#true} is VALID [2018-11-14 16:16:37,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {39978#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:37,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {40025#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {39979#false} is VALID [2018-11-14 16:16:37,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2018-11-14 16:16:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:37,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:37,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:37,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:37,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:37,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:37,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:37,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:37,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:37,633 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-11-14 16:16:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:39,294 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-11-14 16:16:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:39,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2018-11-14 16:16:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2018-11-14 16:16:39,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2018-11-14 16:16:39,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:39,650 INFO L225 Difference]: With dead ends: 2701 [2018-11-14 16:16:39,650 INFO L226 Difference]: Without dead ends: 2699 [2018-11-14 16:16:39,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-11-14 16:16:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-11-14 16:16:40,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:40,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand 2377 states. [2018-11-14 16:16:40,289 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand 2377 states. [2018-11-14 16:16:40,289 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand 2377 states. [2018-11-14 16:16:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:40,544 INFO L93 Difference]: Finished difference Result 2699 states and 3496 transitions. [2018-11-14 16:16:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3496 transitions. [2018-11-14 16:16:40,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:40,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:40,547 INFO L74 IsIncluded]: Start isIncluded. First operand 2377 states. Second operand 2699 states. [2018-11-14 16:16:40,547 INFO L87 Difference]: Start difference. First operand 2377 states. Second operand 2699 states. [2018-11-14 16:16:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:40,810 INFO L93 Difference]: Finished difference Result 2699 states and 3496 transitions. [2018-11-14 16:16:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3496 transitions. [2018-11-14 16:16:40,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:40,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:40,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:40,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-14 16:16:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-11-14 16:16:41,039 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-11-14 16:16:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:41,039 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-11-14 16:16:41,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-11-14 16:16:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:16:41,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:41,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:41,041 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:41,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-11-14 16:16:41,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:41,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:41,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:41,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {50737#true} call ULTIMATE.init(); {50737#true} is VALID [2018-11-14 16:16:41,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {50737#true} assume true; {50737#true} is VALID [2018-11-14 16:16:41,149 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50737#true} {50737#true} #164#return; {50737#true} is VALID [2018-11-14 16:16:41,149 INFO L256 TraceCheckUtils]: 3: Hoare triple {50737#true} call #t~ret9 := main(); {50737#true} is VALID [2018-11-14 16:16:41,150 INFO L273 TraceCheckUtils]: 4: Hoare triple {50737#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {50737#true} is VALID [2018-11-14 16:16:41,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {50737#true} assume true; {50737#true} is VALID [2018-11-14 16:16:41,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {50737#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {50737#true} is VALID [2018-11-14 16:16:41,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {50737#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {50737#true} is VALID [2018-11-14 16:16:41,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {50737#true} assume !(~p1~0 != 0bv32); {50737#true} is VALID [2018-11-14 16:16:41,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {50737#true} assume !(~p2~0 != 0bv32); {50737#true} is VALID [2018-11-14 16:16:41,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {50737#true} assume !(~p3~0 != 0bv32); {50737#true} is VALID [2018-11-14 16:16:41,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {50737#true} assume !(~p4~0 != 0bv32); {50737#true} is VALID [2018-11-14 16:16:41,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {50737#true} assume !(~p5~0 != 0bv32); {50737#true} is VALID [2018-11-14 16:16:41,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {50737#true} assume !(~p6~0 != 0bv32); {50737#true} is VALID [2018-11-14 16:16:41,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {50737#true} assume !(~p7~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {50784#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:41,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {50784#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {50738#false} is VALID [2018-11-14 16:16:41,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {50738#false} assume ~lk7~0 != 1bv32; {50738#false} is VALID [2018-11-14 16:16:41,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {50738#false} assume !false; {50738#false} is VALID [2018-11-14 16:16:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:41,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:41,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:41,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:41,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:41,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:41,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:41,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:41,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:41,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:41,182 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-11-14 16:16:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:43,731 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-11-14 16:16:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:43,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:16:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-14 16:16:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-14 16:16:43,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-14 16:16:43,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:44,318 INFO L225 Difference]: With dead ends: 5389 [2018-11-14 16:16:44,319 INFO L226 Difference]: Without dead ends: 3083 [2018-11-14 16:16:44,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-14 16:16:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-11-14 16:16:46,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:46,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3083 states. Second operand 3081 states. [2018-11-14 16:16:46,253 INFO L74 IsIncluded]: Start isIncluded. First operand 3083 states. Second operand 3081 states. [2018-11-14 16:16:46,253 INFO L87 Difference]: Start difference. First operand 3083 states. Second operand 3081 states. [2018-11-14 16:16:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:46,602 INFO L93 Difference]: Finished difference Result 3083 states and 3784 transitions. [2018-11-14 16:16:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3784 transitions. [2018-11-14 16:16:46,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:46,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:46,605 INFO L74 IsIncluded]: Start isIncluded. First operand 3081 states. Second operand 3083 states. [2018-11-14 16:16:46,606 INFO L87 Difference]: Start difference. First operand 3081 states. Second operand 3083 states. [2018-11-14 16:16:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:46,957 INFO L93 Difference]: Finished difference Result 3083 states and 3784 transitions. [2018-11-14 16:16:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3784 transitions. [2018-11-14 16:16:46,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:46,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:46,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:46,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-11-14 16:16:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-11-14 16:16:47,367 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-11-14 16:16:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:47,367 INFO L480 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-11-14 16:16:47,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-11-14 16:16:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:16:47,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:47,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:47,370 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:47,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:47,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-11-14 16:16:47,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:47,372 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:47,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:47,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:47,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {65784#true} call ULTIMATE.init(); {65784#true} is VALID [2018-11-14 16:16:47,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {65784#true} assume true; {65784#true} is VALID [2018-11-14 16:16:47,460 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {65784#true} {65784#true} #164#return; {65784#true} is VALID [2018-11-14 16:16:47,461 INFO L256 TraceCheckUtils]: 3: Hoare triple {65784#true} call #t~ret9 := main(); {65784#true} is VALID [2018-11-14 16:16:47,461 INFO L273 TraceCheckUtils]: 4: Hoare triple {65784#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {65784#true} is VALID [2018-11-14 16:16:47,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {65784#true} assume true; {65784#true} is VALID [2018-11-14 16:16:47,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {65784#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {65784#true} is VALID [2018-11-14 16:16:47,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {65784#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {65784#true} is VALID [2018-11-14 16:16:47,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {65784#true} assume !(~p1~0 != 0bv32); {65784#true} is VALID [2018-11-14 16:16:47,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {65784#true} assume !(~p2~0 != 0bv32); {65784#true} is VALID [2018-11-14 16:16:47,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {65784#true} assume !(~p3~0 != 0bv32); {65784#true} is VALID [2018-11-14 16:16:47,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {65784#true} assume !(~p4~0 != 0bv32); {65784#true} is VALID [2018-11-14 16:16:47,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {65784#true} assume !(~p5~0 != 0bv32); {65784#true} is VALID [2018-11-14 16:16:47,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {65784#true} assume !(~p6~0 != 0bv32); {65784#true} is VALID [2018-11-14 16:16:47,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {65784#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {65831#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:47,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {65831#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {65785#false} is VALID [2018-11-14 16:16:47,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {65785#false} assume ~p8~0 != 0bv32; {65785#false} is VALID [2018-11-14 16:16:47,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {65785#false} assume ~lk8~0 != 1bv32; {65785#false} is VALID [2018-11-14 16:16:47,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {65785#false} assume !false; {65785#false} is VALID [2018-11-14 16:16:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:47,471 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:47,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:47,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:47,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:47,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:47,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:47,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:47,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:47,497 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-11-14 16:16:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:49,622 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-11-14 16:16:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:49,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-14 16:16:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-14 16:16:49,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-14 16:16:49,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:50,208 INFO L225 Difference]: With dead ends: 4621 [2018-11-14 16:16:50,209 INFO L226 Difference]: Without dead ends: 3147 [2018-11-14 16:16:50,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-11-14 16:16:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-11-14 16:16:51,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:51,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3147 states. Second operand 3145 states. [2018-11-14 16:16:51,527 INFO L74 IsIncluded]: Start isIncluded. First operand 3147 states. Second operand 3145 states. [2018-11-14 16:16:51,527 INFO L87 Difference]: Start difference. First operand 3147 states. Second operand 3145 states. [2018-11-14 16:16:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:51,829 INFO L93 Difference]: Finished difference Result 3147 states and 3784 transitions. [2018-11-14 16:16:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3784 transitions. [2018-11-14 16:16:51,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:51,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:51,832 INFO L74 IsIncluded]: Start isIncluded. First operand 3145 states. Second operand 3147 states. [2018-11-14 16:16:51,833 INFO L87 Difference]: Start difference. First operand 3145 states. Second operand 3147 states. [2018-11-14 16:16:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:52,188 INFO L93 Difference]: Finished difference Result 3147 states and 3784 transitions. [2018-11-14 16:16:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 3784 transitions. [2018-11-14 16:16:52,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:52,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:52,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:52,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-14 16:16:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-11-14 16:16:52,609 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-11-14 16:16:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:52,609 INFO L480 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-11-14 16:16:52,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-11-14 16:16:52,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:16:52,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:52,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:16:52,612 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:52,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-11-14 16:16:52,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:52,612 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:16:52,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:52,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:52,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {80258#true} call ULTIMATE.init(); {80258#true} is VALID [2018-11-14 16:16:52,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {80258#true} assume true; {80258#true} is VALID [2018-11-14 16:16:52,707 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {80258#true} {80258#true} #164#return; {80258#true} is VALID [2018-11-14 16:16:52,707 INFO L256 TraceCheckUtils]: 3: Hoare triple {80258#true} call #t~ret9 := main(); {80258#true} is VALID [2018-11-14 16:16:52,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {80258#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {80258#true} is VALID [2018-11-14 16:16:52,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {80258#true} assume true; {80258#true} is VALID [2018-11-14 16:16:52,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {80258#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {80258#true} is VALID [2018-11-14 16:16:52,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {80258#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {80258#true} is VALID [2018-11-14 16:16:52,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {80258#true} assume !(~p1~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {80258#true} assume !(~p2~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {80258#true} assume !(~p3~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {80258#true} assume !(~p4~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {80258#true} assume !(~p5~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {80258#true} assume !(~p6~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {80258#true} assume !(~p7~0 != 0bv32); {80258#true} is VALID [2018-11-14 16:16:52,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {80258#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:52,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {80308#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {80259#false} is VALID [2018-11-14 16:16:52,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {80259#false} assume !false; {80259#false} is VALID [2018-11-14 16:16:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:16:52,714 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:52,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:52,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:52,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:52,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:52,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:52,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:52,740 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-11-14 16:16:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:57,770 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-11-14 16:16:57,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:57,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:16:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-14 16:16:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2018-11-14 16:16:57,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2018-11-14 16:16:57,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:58,942 INFO L225 Difference]: With dead ends: 5131 [2018-11-14 16:16:58,942 INFO L226 Difference]: Without dead ends: 5129 [2018-11-14 16:16:58,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-11-14 16:17:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-11-14 16:17:00,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:17:00,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5129 states. Second operand 4745 states. [2018-11-14 16:17:00,293 INFO L74 IsIncluded]: Start isIncluded. First operand 5129 states. Second operand 4745 states. [2018-11-14 16:17:00,293 INFO L87 Difference]: Start difference. First operand 5129 states. Second operand 4745 states. [2018-11-14 16:17:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:01,231 INFO L93 Difference]: Finished difference Result 5129 states and 5959 transitions. [2018-11-14 16:17:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 5959 transitions. [2018-11-14 16:17:01,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:01,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:17:01,237 INFO L74 IsIncluded]: Start isIncluded. First operand 4745 states. Second operand 5129 states. [2018-11-14 16:17:01,237 INFO L87 Difference]: Start difference. First operand 4745 states. Second operand 5129 states. [2018-11-14 16:17:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:02,216 INFO L93 Difference]: Finished difference Result 5129 states and 5959 transitions. [2018-11-14 16:17:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 5959 transitions. [2018-11-14 16:17:02,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:02,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:17:02,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:17:02,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:17:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-11-14 16:17:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-11-14 16:17:03,159 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-11-14 16:17:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:17:03,159 INFO L480 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-11-14 16:17:03,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:17:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-11-14 16:17:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:17:03,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:17:03,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:17:03,165 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:17:03,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:17:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-11-14 16:17:03,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:17:03,166 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:17:03,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:17:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:17:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:17:03,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:17:03,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {100869#true} call ULTIMATE.init(); {100869#true} is VALID [2018-11-14 16:17:03,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {100869#true} assume true; {100869#true} is VALID [2018-11-14 16:17:03,261 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {100869#true} {100869#true} #164#return; {100869#true} is VALID [2018-11-14 16:17:03,261 INFO L256 TraceCheckUtils]: 3: Hoare triple {100869#true} call #t~ret9 := main(); {100869#true} is VALID [2018-11-14 16:17:03,261 INFO L273 TraceCheckUtils]: 4: Hoare triple {100869#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;havoc ~cond~0; {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {100869#true} assume true; {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {100869#true} assume !false;~cond~0 := #t~nondet8;havoc #t~nondet8; {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {100869#true} assume !(~cond~0 == 0bv32);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32; {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {100869#true} assume !(~p1~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {100869#true} assume !(~p2~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {100869#true} assume !(~p3~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {100869#true} assume !(~p4~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {100869#true} assume !(~p5~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {100869#true} assume !(~p6~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {100869#true} assume !(~p7~0 != 0bv32); {100869#true} is VALID [2018-11-14 16:17:03,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {100869#true} assume !(~p8~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p1~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p2~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p3~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p4~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p5~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p6~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume !(~p7~0 != 0bv32); {100919#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:17:03,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {100919#(= (_ bv0 32) main_~p8~0)} assume ~p8~0 != 0bv32; {100870#false} is VALID [2018-11-14 16:17:03,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {100870#false} assume ~lk8~0 != 1bv32; {100870#false} is VALID [2018-11-14 16:17:03,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {100870#false} assume !false; {100870#false} is VALID [2018-11-14 16:17:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:17:03,268 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:17:03,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:17:03,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:17:03,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:17:03,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:17:03,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:17:03,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:17:03,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:17:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:17:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:17:03,294 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-11-14 16:17:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:11,685 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-11-14 16:17:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:17:11,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:17:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:17:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:17:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-14 16:17:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:17:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-14 16:17:11,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-14 16:17:11,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:17:11,837 INFO L225 Difference]: With dead ends: 10633 [2018-11-14 16:17:11,837 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:17:11,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:17:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:17:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:17:11,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:17:11,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:17:11,856 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:17:11,856 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:17:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:11,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:17:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:17:11,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:11,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:17:11,857 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:17:11,857 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:17:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:11,857 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:17:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:17:11,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:11,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:17:11,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:17:11,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:17:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:17:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:17:11,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-14 16:17:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:17:11,859 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:17:11,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:17:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:17:11,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:17:11,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:17:12,231 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:17:12,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:17:12,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:17:12,231 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:17:12,231 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:17:12,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-14 16:17:12,232 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-14 16:17:12,233 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-14 16:17:12,234 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,234 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,234 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,234 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,234 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-14 16:17:12,234 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,235 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-14 16:17:12,236 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,236 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,236 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-14 16:17:12,236 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-14 16:17:12,236 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-14 16:17:12,237 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-14 16:17:12,238 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-14 16:17:12,239 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-14 16:17:12,240 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-14 16:17:12,241 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-14 16:17:12,242 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-14 16:17:12,242 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-14 16:17:12,242 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-14 16:17:12,242 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-14 16:17:12,242 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 16:17:12,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:17:12 BoogieIcfgContainer [2018-11-14 16:17:12,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:17:12,249 INFO L168 Benchmark]: Toolchain (without parser) took 62740.30 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:17:12,250 INFO L168 Benchmark]: CDTParser took 0.23 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 16:17:12,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.91 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 16:17:12,251 INFO L168 Benchmark]: Boogie Preprocessor took 64.21 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 16:17:12,251 INFO L168 Benchmark]: RCFGBuilder took 851.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:17:12,252 INFO L168 Benchmark]: TraceAbstraction took 61501.25 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 482.9 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -511.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:17:12,255 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.23 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 317.91 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 64.21 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 851.62 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61501.25 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 482.9 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -511.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 39 locations, 1 error locations. SAFE Result, 61.4s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 37.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, 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: 17.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 22455 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1042 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...