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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:42,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:42,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:42,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:42,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:42,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:42,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:42,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:42,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:42,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:42,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:42,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:42,624 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:42,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:42,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:42,627 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:42,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:42,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:42,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:42,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:42,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:42,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:42,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:42,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:42,639 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:42,640 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:42,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:42,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:42,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:42,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:42,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:42,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:42,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:42,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:42,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:42,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:42,648 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-23 10:54:42,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:42,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:42,676 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:42,676 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:42,676 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:42,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:42,677 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:42,677 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:42,677 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:42,677 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:42,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:42,678 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:42,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:42,678 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:42,678 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:42,679 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:42,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:42,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:42,680 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:42,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:42,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:42,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:42,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:42,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:42,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:42,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:42,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:42,682 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:42,682 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:42,682 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:42,683 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:42,683 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:42,683 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:42,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:42,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:42,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:42,747 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:42,748 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:42,749 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:42,807 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba551db2/98754239bf6e459fb13699896c703042/FLAGa1b57401c [2018-11-23 10:54:43,235 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:43,236 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:43,244 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba551db2/98754239bf6e459fb13699896c703042/FLAGa1b57401c [2018-11-23 10:54:43,594 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba551db2/98754239bf6e459fb13699896c703042 [2018-11-23 10:54:43,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:43,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:43,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:43,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:43,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:43,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:43" (1/1) ... [2018-11-23 10:54:43,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7377a64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:43, skipping insertion in model container [2018-11-23 10:54:43,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:43" (1/1) ... [2018-11-23 10:54:43,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:43,655 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:43,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:43,940 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:43,983 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:44,003 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:44,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44 WrapperNode [2018-11-23 10:54:44,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:44,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:44,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:44,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:44,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:44,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:44,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:44,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:44,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (1/1) ... [2018-11-23 10:54:44,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:44,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:44,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:44,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:44,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (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-23 10:54:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:44,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:44,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:45,017 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:45,018 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:45,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:45 BoogieIcfgContainer [2018-11-23 10:54:45,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:45,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:45,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:45,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:45,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:43" (1/3) ... [2018-11-23 10:54:45,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466bb2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:45, skipping insertion in model container [2018-11-23 10:54:45,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:44" (2/3) ... [2018-11-23 10:54:45,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466bb2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:45, skipping insertion in model container [2018-11-23 10:54:45,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:45" (3/3) ... [2018-11-23 10:54:45,030 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:45,040 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:45,049 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:45,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:45,101 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:45,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:45,102 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:45,102 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:45,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:45,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:45,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:45,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:45,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 10:54:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:45,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:45,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:45,133 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:45,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:45,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2018-11-23 10:54:45,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:45,143 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-23 10:54:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:45,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:45,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 10:54:45,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 10:54:45,498 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #146#return; {38#true} is VALID [2018-11-23 10:54:45,498 INFO L256 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret8 := main(); {38#true} is VALID [2018-11-23 10:54:45,499 INFO L273 TraceCheckUtils]: 4: Hoare triple {38#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;havoc ~cond~0; {38#true} is VALID [2018-11-23 10:54:45,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {38#true} is VALID [2018-11-23 10:54:45,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {38#true} is VALID [2018-11-23 10:54:45,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:45,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {64#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {39#false} is VALID [2018-11-23 10:54:45,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 10:54:45,522 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-23 10:54:45,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:45,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:45,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:45,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:45,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:45,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:45,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:45,774 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-11-23 10:54:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,292 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-11-23 10:54:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:46,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:54:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:54:46,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 10:54:46,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:46,933 INFO L225 Difference]: With dead ends: 69 [2018-11-23 10:54:46,933 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:54:46,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:54:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-23 10:54:46,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:46,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 38 states. [2018-11-23 10:54:46,997 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 38 states. [2018-11-23 10:54:46,997 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 38 states. [2018-11-23 10:54:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,005 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2018-11-23 10:54:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2018-11-23 10:54:47,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,007 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 54 states. [2018-11-23 10:54:47,007 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 54 states. [2018-11-23 10:54:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,015 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2018-11-23 10:54:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2018-11-23 10:54:47,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:47,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:54:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-11-23 10:54:47,026 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2018-11-23 10:54:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:47,027 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2018-11-23 10:54:47,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2018-11-23 10:54:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:47,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:47,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:47,029 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:47,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2018-11-23 10:54:47,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:47,031 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-23 10:54:47,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:47,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:47,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 10:54:47,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 10:54:47,203 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {324#true} {324#true} #146#return; {324#true} is VALID [2018-11-23 10:54:47,204 INFO L256 TraceCheckUtils]: 3: Hoare triple {324#true} call #t~ret8 := main(); {324#true} is VALID [2018-11-23 10:54:47,204 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#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;havoc ~cond~0; {324#true} is VALID [2018-11-23 10:54:47,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {324#true} is VALID [2018-11-23 10:54:47,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {324#true} is VALID [2018-11-23 10:54:47,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {324#true} assume !(0bv32 != ~p1~0); {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {350#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:47,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {325#false} is VALID [2018-11-23 10:54:47,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {325#false} assume 1bv32 != ~lk1~0; {325#false} is VALID [2018-11-23 10:54:47,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 10:54:47,219 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-23 10:54:47,219 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:47,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:47,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:47,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:47,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:47,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:47,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:47,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:47,289 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2018-11-23 10:54:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,553 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-23 10:54:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:47,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 10:54:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 10:54:47,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2018-11-23 10:54:48,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,022 INFO L225 Difference]: With dead ends: 87 [2018-11-23 10:54:48,022 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:54:48,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:54:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 10:54:48,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:48,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-23 10:54:48,047 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-23 10:54:48,047 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-23 10:54:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,052 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2018-11-23 10:54:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2018-11-23 10:54:48,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,053 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-23 10:54:48,053 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-23 10:54:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,058 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2018-11-23 10:54:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2018-11-23 10:54:48,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:48,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 10:54:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-11-23 10:54:48,063 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2018-11-23 10:54:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:48,064 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2018-11-23 10:54:48,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2018-11-23 10:54:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:48,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:48,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:48,066 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:48,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2018-11-23 10:54:48,066 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:48,067 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-23 10:54:48,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:48,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2018-11-23 10:54:48,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {641#true} assume true; {641#true} is VALID [2018-11-23 10:54:48,173 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {641#true} {641#true} #146#return; {641#true} is VALID [2018-11-23 10:54:48,173 INFO L256 TraceCheckUtils]: 3: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2018-11-23 10:54:48,173 INFO L273 TraceCheckUtils]: 4: Hoare triple {641#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;havoc ~cond~0; {641#true} is VALID [2018-11-23 10:54:48,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {641#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {641#true} is VALID [2018-11-23 10:54:48,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {641#true} is VALID [2018-11-23 10:54:48,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {641#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {667#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:48,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {667#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {642#false} is VALID [2018-11-23 10:54:48,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {642#false} assume 0bv32 != ~p2~0; {642#false} is VALID [2018-11-23 10:54:48,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {642#false} assume 1bv32 != ~lk2~0; {642#false} is VALID [2018-11-23 10:54:48,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {642#false} assume !false; {642#false} is VALID [2018-11-23 10:54:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:48,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:48,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:48,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:48,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:48,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:48,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:48,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:48,232 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2018-11-23 10:54:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,414 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2018-11-23 10:54:48,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:48,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 10:54:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 10:54:48,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-23 10:54:48,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,618 INFO L225 Difference]: With dead ends: 81 [2018-11-23 10:54:48,618 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 10:54:48,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 10:54:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 10:54:48,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:48,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 10:54:48,653 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 10:54:48,653 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 10:54:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,663 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2018-11-23 10:54:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-11-23 10:54:48,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,664 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 10:54:48,665 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 10:54:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,671 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2018-11-23 10:54:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-11-23 10:54:48,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:48,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 10:54:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-11-23 10:54:48,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2018-11-23 10:54:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:48,685 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2018-11-23 10:54:48,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2018-11-23 10:54:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:48,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:48,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:48,690 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:48,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2018-11-23 10:54:48,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:48,691 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-23 10:54:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:48,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2018-11-23 10:54:48,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2018-11-23 10:54:48,800 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #146#return; {966#true} is VALID [2018-11-23 10:54:48,800 INFO L256 TraceCheckUtils]: 3: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2018-11-23 10:54:48,800 INFO L273 TraceCheckUtils]: 4: Hoare triple {966#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;havoc ~cond~0; {966#true} is VALID [2018-11-23 10:54:48,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {966#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {966#true} is VALID [2018-11-23 10:54:48,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {966#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {966#true} is VALID [2018-11-23 10:54:48,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {966#true} assume !(0bv32 != ~p1~0); {966#true} is VALID [2018-11-23 10:54:48,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {966#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:48,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {995#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {967#false} is VALID [2018-11-23 10:54:48,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {967#false} assume !false; {967#false} is VALID [2018-11-23 10:54:48,819 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-23 10:54:48,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:48,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:48,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:48,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:48,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:48,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:48,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:48,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:48,849 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2018-11-23 10:54:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,082 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2018-11-23 10:54:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:49,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:54:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:54:49,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 10:54:49,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,279 INFO L225 Difference]: With dead ends: 100 [2018-11-23 10:54:49,279 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 10:54:49,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 10:54:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-11-23 10:54:49,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:49,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 72 states. [2018-11-23 10:54:49,339 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 72 states. [2018-11-23 10:54:49,339 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 72 states. [2018-11-23 10:54:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,345 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2018-11-23 10:54:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 165 transitions. [2018-11-23 10:54:49,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,346 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 98 states. [2018-11-23 10:54:49,346 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 98 states. [2018-11-23 10:54:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,352 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2018-11-23 10:54:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 165 transitions. [2018-11-23 10:54:49,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 10:54:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2018-11-23 10:54:49,358 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2018-11-23 10:54:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,359 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2018-11-23 10:54:49,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2018-11-23 10:54:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:49,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:49,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:49,360 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:49,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2018-11-23 10:54:49,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:49,362 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-23 10:54:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:49,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2018-11-23 10:54:49,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {1410#true} assume true; {1410#true} is VALID [2018-11-23 10:54:49,454 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1410#true} {1410#true} #146#return; {1410#true} is VALID [2018-11-23 10:54:49,454 INFO L256 TraceCheckUtils]: 3: Hoare triple {1410#true} call #t~ret8 := main(); {1410#true} is VALID [2018-11-23 10:54:49,455 INFO L273 TraceCheckUtils]: 4: Hoare triple {1410#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;havoc ~cond~0; {1410#true} is VALID [2018-11-23 10:54:49,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {1410#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {1410#true} is VALID [2018-11-23 10:54:49,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {1410#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {1410#true} is VALID [2018-11-23 10:54:49,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {1410#true} assume !(0bv32 != ~p1~0); {1410#true} is VALID [2018-11-23 10:54:49,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {1410#true} assume !(0bv32 != ~p2~0); {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1439#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:49,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {1439#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1411#false} is VALID [2018-11-23 10:54:49,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1411#false} assume 1bv32 != ~lk2~0; {1411#false} is VALID [2018-11-23 10:54:49,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2018-11-23 10:54:49,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-23 10:54:49,471 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:49,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:49,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:49,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:49,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:49,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:49,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,501 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2018-11-23 10:54:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,676 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2018-11-23 10:54:49,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:49,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:54:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:54:49,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 10:54:49,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,928 INFO L225 Difference]: With dead ends: 164 [2018-11-23 10:54:49,928 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 10:54:49,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 10:54:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-23 10:54:49,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:49,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-23 10:54:49,970 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-23 10:54:49,970 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-23 10:54:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,976 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2018-11-23 10:54:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2018-11-23 10:54:49,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,977 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-23 10:54:49,977 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-23 10:54:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,982 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2018-11-23 10:54:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2018-11-23 10:54:49,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 10:54:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2018-11-23 10:54:49,988 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2018-11-23 10:54:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,988 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2018-11-23 10:54:49,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2018-11-23 10:54:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:49,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:49,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:49,989 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:49,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2018-11-23 10:54:49,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:49,990 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-23 10:54:50,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:50,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1952#true} is VALID [2018-11-23 10:54:50,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {1952#true} assume true; {1952#true} is VALID [2018-11-23 10:54:50,093 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1952#true} {1952#true} #146#return; {1952#true} is VALID [2018-11-23 10:54:50,093 INFO L256 TraceCheckUtils]: 3: Hoare triple {1952#true} call #t~ret8 := main(); {1952#true} is VALID [2018-11-23 10:54:50,093 INFO L273 TraceCheckUtils]: 4: Hoare triple {1952#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;havoc ~cond~0; {1952#true} is VALID [2018-11-23 10:54:50,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {1952#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {1952#true} is VALID [2018-11-23 10:54:50,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {1952#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {1952#true} is VALID [2018-11-23 10:54:50,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {1952#true} assume !(0bv32 != ~p1~0); {1952#true} is VALID [2018-11-23 10:54:50,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {1952#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {1981#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:50,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {1981#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {1953#false} is VALID [2018-11-23 10:54:50,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {1953#false} assume 0bv32 != ~p3~0; {1953#false} is VALID [2018-11-23 10:54:50,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {1953#false} assume 1bv32 != ~lk3~0; {1953#false} is VALID [2018-11-23 10:54:50,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2018-11-23 10:54:50,105 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-23 10:54:50,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:50,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:50,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:50,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:50,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:50,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:50,135 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-23 10:54:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:50,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:50,136 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2018-11-23 10:54:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,446 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2018-11-23 10:54:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-23 10:54:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-23 10:54:50,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2018-11-23 10:54:50,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:50,681 INFO L225 Difference]: With dead ends: 147 [2018-11-23 10:54:50,681 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 10:54:50,682 INFO L631 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-23 10:54:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 10:54:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-23 10:54:50,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:50,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2018-11-23 10:54:50,710 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2018-11-23 10:54:50,710 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2018-11-23 10:54:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,714 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2018-11-23 10:54:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2018-11-23 10:54:50,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:50,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:50,715 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2018-11-23 10:54:50,715 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2018-11-23 10:54:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,720 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2018-11-23 10:54:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2018-11-23 10:54:50,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:50,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:50,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:50,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 10:54:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2018-11-23 10:54:50,725 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2018-11-23 10:54:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:50,725 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2018-11-23 10:54:50,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2018-11-23 10:54:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:50,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:50,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:50,727 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:50,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2018-11-23 10:54:50,727 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:50,728 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-23 10:54:50,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:50,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2018-11-23 10:54:50,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {2486#true} assume true; {2486#true} is VALID [2018-11-23 10:54:50,835 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2486#true} {2486#true} #146#return; {2486#true} is VALID [2018-11-23 10:54:50,835 INFO L256 TraceCheckUtils]: 3: Hoare triple {2486#true} call #t~ret8 := main(); {2486#true} is VALID [2018-11-23 10:54:50,835 INFO L273 TraceCheckUtils]: 4: Hoare triple {2486#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;havoc ~cond~0; {2486#true} is VALID [2018-11-23 10:54:50,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {2486#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {2486#true} is VALID [2018-11-23 10:54:50,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {2486#true} is VALID [2018-11-23 10:54:50,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !(0bv32 != ~p1~0); {2486#true} is VALID [2018-11-23 10:54:50,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(0bv32 != ~p2~0); {2486#true} is VALID [2018-11-23 10:54:50,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {2486#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:50,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {2518#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {2487#false} is VALID [2018-11-23 10:54:50,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2018-11-23 10:54:50,859 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-23 10:54:50,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:50,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:50,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:50,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:50,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:50,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:50,892 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-23 10:54:50,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:50,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:50,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:50,893 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2018-11-23 10:54:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,137 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2018-11-23 10:54:51,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:51,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 10:54:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 10:54:51,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 10:54:51,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:51,293 INFO L225 Difference]: With dead ends: 180 [2018-11-23 10:54:51,294 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 10:54:51,294 INFO L631 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-23 10:54:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 10:54:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-11-23 10:54:51,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:51,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 136 states. [2018-11-23 10:54:51,337 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 136 states. [2018-11-23 10:54:51,337 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 136 states. [2018-11-23 10:54:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,344 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2018-11-23 10:54:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 291 transitions. [2018-11-23 10:54:51,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,345 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 178 states. [2018-11-23 10:54:51,345 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 178 states. [2018-11-23 10:54:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,352 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2018-11-23 10:54:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 291 transitions. [2018-11-23 10:54:51,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:51,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 10:54:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2018-11-23 10:54:51,359 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2018-11-23 10:54:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:51,359 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2018-11-23 10:54:51,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2018-11-23 10:54:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:51,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:51,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:51,361 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:51,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2018-11-23 10:54:51,362 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:51,362 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-23 10:54:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:51,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3243#true} is VALID [2018-11-23 10:54:51,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-23 10:54:51,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3243#true} {3243#true} #146#return; {3243#true} is VALID [2018-11-23 10:54:51,484 INFO L256 TraceCheckUtils]: 3: Hoare triple {3243#true} call #t~ret8 := main(); {3243#true} is VALID [2018-11-23 10:54:51,484 INFO L273 TraceCheckUtils]: 4: Hoare triple {3243#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;havoc ~cond~0; {3243#true} is VALID [2018-11-23 10:54:51,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {3243#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {3243#true} is VALID [2018-11-23 10:54:51,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {3243#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {3243#true} is VALID [2018-11-23 10:54:51,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {3243#true} assume !(0bv32 != ~p1~0); {3243#true} is VALID [2018-11-23 10:54:51,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {3243#true} assume !(0bv32 != ~p2~0); {3243#true} is VALID [2018-11-23 10:54:51,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {3243#true} assume !(0bv32 != ~p3~0); {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {3275#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:51,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {3275#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {3244#false} is VALID [2018-11-23 10:54:51,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {3244#false} assume 1bv32 != ~lk3~0; {3244#false} is VALID [2018-11-23 10:54:51,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2018-11-23 10:54:51,496 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-23 10:54:51,496 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:51,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:51,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:51,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:51,537 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-23 10:54:51,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,538 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2018-11-23 10:54:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,744 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-23 10:54:51,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:51,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-23 10:54:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-23 10:54:51,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2018-11-23 10:54:52,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:52,508 INFO L225 Difference]: With dead ends: 312 [2018-11-23 10:54:52,508 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 10:54:52,509 INFO L631 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-23 10:54:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 10:54:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-23 10:54:52,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:52,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2018-11-23 10:54:52,591 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2018-11-23 10:54:52,591 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2018-11-23 10:54:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,599 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2018-11-23 10:54:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2018-11-23 10:54:52,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:52,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:52,601 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2018-11-23 10:54:52,601 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2018-11-23 10:54:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,608 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2018-11-23 10:54:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2018-11-23 10:54:52,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:52,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:52,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:52,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 10:54:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2018-11-23 10:54:52,616 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2018-11-23 10:54:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:52,616 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2018-11-23 10:54:52,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2018-11-23 10:54:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:52,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:52,618 INFO L402 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-23 10:54:52,618 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:52,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2018-11-23 10:54:52,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:52,619 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-23 10:54:52,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:52,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:52,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2018-11-23 10:54:52,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {4204#true} assume true; {4204#true} is VALID [2018-11-23 10:54:52,745 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4204#true} {4204#true} #146#return; {4204#true} is VALID [2018-11-23 10:54:52,746 INFO L256 TraceCheckUtils]: 3: Hoare triple {4204#true} call #t~ret8 := main(); {4204#true} is VALID [2018-11-23 10:54:52,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {4204#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;havoc ~cond~0; {4204#true} is VALID [2018-11-23 10:54:52,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {4204#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {4204#true} is VALID [2018-11-23 10:54:52,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {4204#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {4204#true} is VALID [2018-11-23 10:54:52,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {4204#true} assume !(0bv32 != ~p1~0); {4204#true} is VALID [2018-11-23 10:54:52,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {4204#true} assume !(0bv32 != ~p2~0); {4204#true} is VALID [2018-11-23 10:54:52,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {4204#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {4236#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:52,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {4236#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {4205#false} is VALID [2018-11-23 10:54:52,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {4205#false} assume 0bv32 != ~p4~0; {4205#false} is VALID [2018-11-23 10:54:52,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {4205#false} assume 1bv32 != ~lk4~0; {4205#false} is VALID [2018-11-23 10:54:52,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2018-11-23 10:54:52,758 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-23 10:54:52,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:52,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:52,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:52,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:52,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:52,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:52,799 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-23 10:54:52,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:52,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:52,800 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2018-11-23 10:54:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,023 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2018-11-23 10:54:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:53,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:54:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 10:54:53,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 10:54:53,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:53,288 INFO L225 Difference]: With dead ends: 276 [2018-11-23 10:54:53,288 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 10:54:53,288 INFO L631 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-23 10:54:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 10:54:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-11-23 10:54:53,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:53,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 188 states. [2018-11-23 10:54:53,336 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 188 states. [2018-11-23 10:54:53,336 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 188 states. [2018-11-23 10:54:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,342 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2018-11-23 10:54:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2018-11-23 10:54:53,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:53,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:53,343 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 190 states. [2018-11-23 10:54:53,344 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 190 states. [2018-11-23 10:54:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,348 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2018-11-23 10:54:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2018-11-23 10:54:53,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:53,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:53,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:53,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-23 10:54:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2018-11-23 10:54:53,354 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2018-11-23 10:54:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:53,354 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2018-11-23 10:54:53,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2018-11-23 10:54:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:53,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:53,356 INFO L402 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-23 10:54:53,356 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:53,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:53,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2018-11-23 10:54:53,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:53,357 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-23 10:54:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:53,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:53,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {5144#true} call ULTIMATE.init(); {5144#true} is VALID [2018-11-23 10:54:53,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {5144#true} assume true; {5144#true} is VALID [2018-11-23 10:54:53,675 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5144#true} {5144#true} #146#return; {5144#true} is VALID [2018-11-23 10:54:53,675 INFO L256 TraceCheckUtils]: 3: Hoare triple {5144#true} call #t~ret8 := main(); {5144#true} is VALID [2018-11-23 10:54:53,676 INFO L273 TraceCheckUtils]: 4: Hoare triple {5144#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;havoc ~cond~0; {5144#true} is VALID [2018-11-23 10:54:53,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {5144#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {5144#true} is VALID [2018-11-23 10:54:53,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {5144#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {5144#true} is VALID [2018-11-23 10:54:53,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {5144#true} assume !(0bv32 != ~p1~0); {5144#true} is VALID [2018-11-23 10:54:53,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {5144#true} assume !(0bv32 != ~p2~0); {5144#true} is VALID [2018-11-23 10:54:53,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {5144#true} assume !(0bv32 != ~p3~0); {5144#true} is VALID [2018-11-23 10:54:53,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {5144#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:53,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {5179#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {5145#false} is VALID [2018-11-23 10:54:53,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {5145#false} assume !false; {5145#false} is VALID [2018-11-23 10:54:53,682 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-23 10:54:53,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:53,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:53,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:53,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:53,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:53,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:53,860 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-23 10:54:53,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:53,861 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2018-11-23 10:54:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,215 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2018-11-23 10:54:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:54,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:54:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 10:54:54,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 10:54:54,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:54,783 INFO L225 Difference]: With dead ends: 332 [2018-11-23 10:54:54,783 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 10:54:54,784 INFO L631 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-23 10:54:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 10:54:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2018-11-23 10:54:54,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:54,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand 264 states. [2018-11-23 10:54:54,884 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 264 states. [2018-11-23 10:54:54,884 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 264 states. [2018-11-23 10:54:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,894 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2018-11-23 10:54:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2018-11-23 10:54:54,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,895 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 330 states. [2018-11-23 10:54:54,895 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 330 states. [2018-11-23 10:54:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,905 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2018-11-23 10:54:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2018-11-23 10:54:54,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:54,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 10:54:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2018-11-23 10:54:54,913 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2018-11-23 10:54:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:54,913 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2018-11-23 10:54:54,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2018-11-23 10:54:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:54,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:54,915 INFO L402 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-23 10:54:54,915 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:54,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2018-11-23 10:54:54,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:54,916 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-23 10:54:54,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:54,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:55,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {6500#true} call ULTIMATE.init(); {6500#true} is VALID [2018-11-23 10:54:55,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {6500#true} assume true; {6500#true} is VALID [2018-11-23 10:54:55,528 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6500#true} {6500#true} #146#return; {6500#true} is VALID [2018-11-23 10:54:55,528 INFO L256 TraceCheckUtils]: 3: Hoare triple {6500#true} call #t~ret8 := main(); {6500#true} is VALID [2018-11-23 10:54:55,528 INFO L273 TraceCheckUtils]: 4: Hoare triple {6500#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;havoc ~cond~0; {6500#true} is VALID [2018-11-23 10:54:55,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {6500#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {6500#true} is VALID [2018-11-23 10:54:55,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {6500#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {6500#true} is VALID [2018-11-23 10:54:55,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {6500#true} assume !(0bv32 != ~p1~0); {6500#true} is VALID [2018-11-23 10:54:55,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {6500#true} assume !(0bv32 != ~p2~0); {6500#true} is VALID [2018-11-23 10:54:55,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {6500#true} assume !(0bv32 != ~p3~0); {6500#true} is VALID [2018-11-23 10:54:55,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {6500#true} assume !(0bv32 != ~p4~0); {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {6535#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:55,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {6535#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {6501#false} is VALID [2018-11-23 10:54:55,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {6501#false} assume 1bv32 != ~lk4~0; {6501#false} is VALID [2018-11-23 10:54:55,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {6501#false} assume !false; {6501#false} is VALID [2018-11-23 10:54:55,551 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-23 10:54:55,551 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:55,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:55,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:55,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:55,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:55,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:55,590 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-23 10:54:55,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:55,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:55,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:55,591 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2018-11-23 10:54:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:55,996 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2018-11-23 10:54:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:55,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-23 10:54:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-23 10:54:56,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-23 10:54:56,756 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-23 10:54:56,763 INFO L225 Difference]: With dead ends: 604 [2018-11-23 10:54:56,763 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 10:54:56,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-23 10:54:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 10:54:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-23 10:54:57,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:57,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand 352 states. [2018-11-23 10:54:57,308 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 352 states. [2018-11-23 10:54:57,309 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 352 states. [2018-11-23 10:54:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,319 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2018-11-23 10:54:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 519 transitions. [2018-11-23 10:54:57,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:57,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:57,321 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 354 states. [2018-11-23 10:54:57,321 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 354 states. [2018-11-23 10:54:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,331 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2018-11-23 10:54:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 519 transitions. [2018-11-23 10:54:57,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:57,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:57,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:57,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-23 10:54:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2018-11-23 10:54:57,342 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2018-11-23 10:54:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:57,343 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2018-11-23 10:54:57,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2018-11-23 10:54:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:57,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:57,344 INFO L402 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-23 10:54:57,344 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:57,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2018-11-23 10:54:57,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:57,345 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-23 10:54:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:57,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:57,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {8280#true} call ULTIMATE.init(); {8280#true} is VALID [2018-11-23 10:54:57,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {8280#true} assume true; {8280#true} is VALID [2018-11-23 10:54:57,907 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8280#true} {8280#true} #146#return; {8280#true} is VALID [2018-11-23 10:54:57,907 INFO L256 TraceCheckUtils]: 3: Hoare triple {8280#true} call #t~ret8 := main(); {8280#true} is VALID [2018-11-23 10:54:57,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {8280#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;havoc ~cond~0; {8280#true} is VALID [2018-11-23 10:54:57,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {8280#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {8280#true} is VALID [2018-11-23 10:54:57,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {8280#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {8280#true} is VALID [2018-11-23 10:54:57,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {8280#true} assume !(0bv32 != ~p1~0); {8280#true} is VALID [2018-11-23 10:54:57,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {8280#true} assume !(0bv32 != ~p2~0); {8280#true} is VALID [2018-11-23 10:54:57,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {8280#true} assume !(0bv32 != ~p3~0); {8280#true} is VALID [2018-11-23 10:54:57,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {8280#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,931 INFO L273 TraceCheckUtils]: 16: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {8315#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:57,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {8315#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {8281#false} is VALID [2018-11-23 10:54:57,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {8281#false} assume 0bv32 != ~p5~0; {8281#false} is VALID [2018-11-23 10:54:57,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {8281#false} assume 1bv32 != ~lk5~0; {8281#false} is VALID [2018-11-23 10:54:57,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2018-11-23 10:54:57,932 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-23 10:54:57,932 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:57,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:57,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:57,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:57,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:57,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:57,963 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-23 10:54:57,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:57,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:57,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:57,964 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2018-11-23 10:54:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,356 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2018-11-23 10:54:58,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:58,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 10:54:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 10:54:58,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2018-11-23 10:54:58,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:58,545 INFO L225 Difference]: With dead ends: 528 [2018-11-23 10:54:58,545 INFO L226 Difference]: Without dead ends: 362 [2018-11-23 10:54:58,546 INFO L631 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-23 10:54:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-23 10:54:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-11-23 10:54:58,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:58,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand 360 states. [2018-11-23 10:54:58,713 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand 360 states. [2018-11-23 10:54:58,713 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 360 states. [2018-11-23 10:54:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,722 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2018-11-23 10:54:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2018-11-23 10:54:58,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,723 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 362 states. [2018-11-23 10:54:58,723 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 362 states. [2018-11-23 10:54:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,733 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2018-11-23 10:54:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2018-11-23 10:54:58,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:58,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-23 10:54:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2018-11-23 10:54:58,745 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2018-11-23 10:54:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:58,745 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2018-11-23 10:54:58,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2018-11-23 10:54:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:58,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:58,747 INFO L402 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-23 10:54:58,747 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:58,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2018-11-23 10:54:58,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:58,748 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-23 10:54:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:58,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {10011#true} call ULTIMATE.init(); {10011#true} is VALID [2018-11-23 10:54:58,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {10011#true} assume true; {10011#true} is VALID [2018-11-23 10:54:58,871 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10011#true} {10011#true} #146#return; {10011#true} is VALID [2018-11-23 10:54:58,872 INFO L256 TraceCheckUtils]: 3: Hoare triple {10011#true} call #t~ret8 := main(); {10011#true} is VALID [2018-11-23 10:54:58,872 INFO L273 TraceCheckUtils]: 4: Hoare triple {10011#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;havoc ~cond~0; {10011#true} is VALID [2018-11-23 10:54:58,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {10011#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {10011#true} is VALID [2018-11-23 10:54:58,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {10011#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {10011#true} is VALID [2018-11-23 10:54:58,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {10011#true} assume !(0bv32 != ~p1~0); {10011#true} is VALID [2018-11-23 10:54:58,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {10011#true} assume !(0bv32 != ~p2~0); {10011#true} is VALID [2018-11-23 10:54:58,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {10011#true} assume !(0bv32 != ~p3~0); {10011#true} is VALID [2018-11-23 10:54:58,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {10011#true} assume !(0bv32 != ~p4~0); {10011#true} is VALID [2018-11-23 10:54:58,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {10011#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,882 INFO L273 TraceCheckUtils]: 18: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:58,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {10049#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {10012#false} is VALID [2018-11-23 10:54:58,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2018-11-23 10:54:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:58,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:58,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:58,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:58,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:58,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:58,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:58,910 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-23 10:54:58,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:58,912 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2018-11-23 10:54:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,419 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2018-11-23 10:54:59,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:59,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 10:54:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 10:54:59,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-23 10:54:59,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:59,554 INFO L225 Difference]: With dead ends: 620 [2018-11-23 10:54:59,555 INFO L226 Difference]: Without dead ends: 618 [2018-11-23 10:54:59,555 INFO L631 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-23 10:54:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-23 10:54:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-11-23 10:54:59,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:59,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand 520 states. [2018-11-23 10:54:59,741 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand 520 states. [2018-11-23 10:54:59,741 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 520 states. [2018-11-23 10:54:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,761 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2018-11-23 10:54:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 887 transitions. [2018-11-23 10:54:59,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,763 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand 618 states. [2018-11-23 10:54:59,763 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 618 states. [2018-11-23 10:54:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,784 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2018-11-23 10:54:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 887 transitions. [2018-11-23 10:54:59,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:59,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:59,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:59,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 10:54:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2018-11-23 10:54:59,802 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2018-11-23 10:54:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:59,802 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2018-11-23 10:54:59,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2018-11-23 10:54:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:59,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:59,804 INFO L402 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-23 10:54:59,804 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:59,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2018-11-23 10:54:59,805 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:59,805 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-23 10:54:59,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:59,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {12514#true} call ULTIMATE.init(); {12514#true} is VALID [2018-11-23 10:54:59,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {12514#true} assume true; {12514#true} is VALID [2018-11-23 10:54:59,915 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12514#true} {12514#true} #146#return; {12514#true} is VALID [2018-11-23 10:54:59,916 INFO L256 TraceCheckUtils]: 3: Hoare triple {12514#true} call #t~ret8 := main(); {12514#true} is VALID [2018-11-23 10:54:59,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {12514#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;havoc ~cond~0; {12514#true} is VALID [2018-11-23 10:54:59,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {12514#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {12514#true} is VALID [2018-11-23 10:54:59,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {12514#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {12514#true} is VALID [2018-11-23 10:54:59,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {12514#true} assume !(0bv32 != ~p1~0); {12514#true} is VALID [2018-11-23 10:54:59,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {12514#true} assume !(0bv32 != ~p2~0); {12514#true} is VALID [2018-11-23 10:54:59,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {12514#true} assume !(0bv32 != ~p3~0); {12514#true} is VALID [2018-11-23 10:54:59,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {12514#true} assume !(0bv32 != ~p4~0); {12514#true} is VALID [2018-11-23 10:54:59,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {12514#true} assume !(0bv32 != ~p5~0); {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {12552#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:59,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {12552#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {12515#false} is VALID [2018-11-23 10:54:59,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {12515#false} assume 1bv32 != ~lk5~0; {12515#false} is VALID [2018-11-23 10:54:59,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {12515#false} assume !false; {12515#false} is VALID [2018-11-23 10:54:59,930 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-23 10:54:59,930 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:59,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:59,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:59,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:59,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:59,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:59,952 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-23 10:54:59,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:59,954 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2018-11-23 10:55:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:00,679 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2018-11-23 10:55:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:00,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:55:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2018-11-23 10:55:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2018-11-23 10:55:00,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2018-11-23 10:55:01,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:01,502 INFO L225 Difference]: With dead ends: 1180 [2018-11-23 10:55:01,502 INFO L226 Difference]: Without dead ends: 682 [2018-11-23 10:55:01,504 INFO L631 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-23 10:55:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-23 10:55:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-11-23 10:55:02,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:02,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand 680 states. [2018-11-23 10:55:02,081 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand 680 states. [2018-11-23 10:55:02,081 INFO L87 Difference]: Start difference. First operand 682 states. Second operand 680 states. [2018-11-23 10:55:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:02,105 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2018-11-23 10:55:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 919 transitions. [2018-11-23 10:55:02,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:02,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:02,106 INFO L74 IsIncluded]: Start isIncluded. First operand 680 states. Second operand 682 states. [2018-11-23 10:55:02,107 INFO L87 Difference]: Start difference. First operand 680 states. Second operand 682 states. [2018-11-23 10:55:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:02,132 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2018-11-23 10:55:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 919 transitions. [2018-11-23 10:55:02,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:02,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:02,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:02,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-23 10:55:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2018-11-23 10:55:02,158 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2018-11-23 10:55:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:02,159 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2018-11-23 10:55:02,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2018-11-23 10:55:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:02,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:02,160 INFO L402 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-23 10:55:02,161 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:02,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2018-11-23 10:55:02,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:02,161 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-23 10:55:02,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:02,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:02,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {15897#true} call ULTIMATE.init(); {15897#true} is VALID [2018-11-23 10:55:02,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {15897#true} assume true; {15897#true} is VALID [2018-11-23 10:55:02,254 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15897#true} {15897#true} #146#return; {15897#true} is VALID [2018-11-23 10:55:02,255 INFO L256 TraceCheckUtils]: 3: Hoare triple {15897#true} call #t~ret8 := main(); {15897#true} is VALID [2018-11-23 10:55:02,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {15897#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;havoc ~cond~0; {15897#true} is VALID [2018-11-23 10:55:02,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {15897#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {15897#true} is VALID [2018-11-23 10:55:02,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {15897#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {15897#true} is VALID [2018-11-23 10:55:02,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {15897#true} assume !(0bv32 != ~p1~0); {15897#true} is VALID [2018-11-23 10:55:02,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {15897#true} assume !(0bv32 != ~p2~0); {15897#true} is VALID [2018-11-23 10:55:02,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {15897#true} assume !(0bv32 != ~p3~0); {15897#true} is VALID [2018-11-23 10:55:02,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {15897#true} assume !(0bv32 != ~p4~0); {15897#true} is VALID [2018-11-23 10:55:02,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {15897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {15935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:55:02,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {15935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {15898#false} is VALID [2018-11-23 10:55:02,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {15898#false} assume 0bv32 != ~p6~0; {15898#false} is VALID [2018-11-23 10:55:02,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {15898#false} assume 1bv32 != ~lk6~0; {15898#false} is VALID [2018-11-23 10:55:02,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {15898#false} assume !false; {15898#false} is VALID [2018-11-23 10:55:02,269 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-23 10:55:02,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:02,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:02,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:02,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:02,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:02,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-23 10:55:02,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:02,293 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2018-11-23 10:55:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:03,513 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2018-11-23 10:55:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:03,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-23 10:55:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-23 10:55:03,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2018-11-23 10:55:03,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:03,675 INFO L225 Difference]: With dead ends: 1020 [2018-11-23 10:55:03,675 INFO L226 Difference]: Without dead ends: 698 [2018-11-23 10:55:03,677 INFO L631 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-23 10:55:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-23 10:55:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-23 10:55:04,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:04,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand 696 states. [2018-11-23 10:55:04,165 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand 696 states. [2018-11-23 10:55:04,165 INFO L87 Difference]: Start difference. First operand 698 states. Second operand 696 states. [2018-11-23 10:55:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,187 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2018-11-23 10:55:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 919 transitions. [2018-11-23 10:55:04,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:04,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:04,189 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand 698 states. [2018-11-23 10:55:04,189 INFO L87 Difference]: Start difference. First operand 696 states. Second operand 698 states. [2018-11-23 10:55:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,216 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2018-11-23 10:55:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 919 transitions. [2018-11-23 10:55:04,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:04,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:04,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:04,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-23 10:55:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2018-11-23 10:55:04,246 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2018-11-23 10:55:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:04,246 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2018-11-23 10:55:04,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2018-11-23 10:55:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:04,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:04,248 INFO L402 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-23 10:55:04,248 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:04,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2018-11-23 10:55:04,248 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:04,249 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-23 10:55:04,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:04,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:04,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {19171#true} call ULTIMATE.init(); {19171#true} is VALID [2018-11-23 10:55:04,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {19171#true} assume true; {19171#true} is VALID [2018-11-23 10:55:04,346 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19171#true} {19171#true} #146#return; {19171#true} is VALID [2018-11-23 10:55:04,346 INFO L256 TraceCheckUtils]: 3: Hoare triple {19171#true} call #t~ret8 := main(); {19171#true} is VALID [2018-11-23 10:55:04,347 INFO L273 TraceCheckUtils]: 4: Hoare triple {19171#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;havoc ~cond~0; {19171#true} is VALID [2018-11-23 10:55:04,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {19171#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {19171#true} is VALID [2018-11-23 10:55:04,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {19171#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {19171#true} is VALID [2018-11-23 10:55:04,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {19171#true} assume !(0bv32 != ~p1~0); {19171#true} is VALID [2018-11-23 10:55:04,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {19171#true} assume !(0bv32 != ~p2~0); {19171#true} is VALID [2018-11-23 10:55:04,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {19171#true} assume !(0bv32 != ~p3~0); {19171#true} is VALID [2018-11-23 10:55:04,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {19171#true} assume !(0bv32 != ~p4~0); {19171#true} is VALID [2018-11-23 10:55:04,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {19171#true} assume !(0bv32 != ~p5~0); {19171#true} is VALID [2018-11-23 10:55:04,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {19171#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:04,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {19212#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {19172#false} is VALID [2018-11-23 10:55:04,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {19172#false} assume !false; {19172#false} is VALID [2018-11-23 10:55:04,362 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-23 10:55:04,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:04,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:04,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:04,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:04,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:04,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:04,387 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-23 10:55:04,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:04,388 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2018-11-23 10:55:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,104 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2018-11-23 10:55:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:05,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 10:55:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 10:55:05,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 10:55:05,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:05,237 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 10:55:05,237 INFO L226 Difference]: Without dead ends: 1162 [2018-11-23 10:55:05,238 INFO L631 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-23 10:55:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-23 10:55:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2018-11-23 10:55:05,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:05,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1162 states. Second operand 1032 states. [2018-11-23 10:55:05,872 INFO L74 IsIncluded]: Start isIncluded. First operand 1162 states. Second operand 1032 states. [2018-11-23 10:55:05,872 INFO L87 Difference]: Start difference. First operand 1162 states. Second operand 1032 states. [2018-11-23 10:55:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,919 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2018-11-23 10:55:05,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1511 transitions. [2018-11-23 10:55:05,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,920 INFO L74 IsIncluded]: Start isIncluded. First operand 1032 states. Second operand 1162 states. [2018-11-23 10:55:05,921 INFO L87 Difference]: Start difference. First operand 1032 states. Second operand 1162 states. [2018-11-23 10:55:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,975 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2018-11-23 10:55:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1511 transitions. [2018-11-23 10:55:05,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:05,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-23 10:55:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2018-11-23 10:55:06,018 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2018-11-23 10:55:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:06,018 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2018-11-23 10:55:06,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2018-11-23 10:55:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:55:06,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:06,020 INFO L402 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-23 10:55:06,020 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:06,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2018-11-23 10:55:06,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:06,020 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-23 10:55:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:06,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:06,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {23869#true} call ULTIMATE.init(); {23869#true} is VALID [2018-11-23 10:55:06,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {23869#true} assume true; {23869#true} is VALID [2018-11-23 10:55:06,107 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23869#true} {23869#true} #146#return; {23869#true} is VALID [2018-11-23 10:55:06,107 INFO L256 TraceCheckUtils]: 3: Hoare triple {23869#true} call #t~ret8 := main(); {23869#true} is VALID [2018-11-23 10:55:06,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {23869#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;havoc ~cond~0; {23869#true} is VALID [2018-11-23 10:55:06,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {23869#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {23869#true} is VALID [2018-11-23 10:55:06,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {23869#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {23869#true} is VALID [2018-11-23 10:55:06,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {23869#true} assume !(0bv32 != ~p1~0); {23869#true} is VALID [2018-11-23 10:55:06,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {23869#true} assume !(0bv32 != ~p2~0); {23869#true} is VALID [2018-11-23 10:55:06,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {23869#true} assume !(0bv32 != ~p3~0); {23869#true} is VALID [2018-11-23 10:55:06,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {23869#true} assume !(0bv32 != ~p4~0); {23869#true} is VALID [2018-11-23 10:55:06,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {23869#true} assume !(0bv32 != ~p5~0); {23869#true} is VALID [2018-11-23 10:55:06,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {23869#true} assume !(0bv32 != ~p6~0); {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {23910#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:55:06,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {23910#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {23870#false} is VALID [2018-11-23 10:55:06,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {23870#false} assume 1bv32 != ~lk6~0; {23870#false} is VALID [2018-11-23 10:55:06,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {23870#false} assume !false; {23870#false} is VALID [2018-11-23 10:55:06,116 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-23 10:55:06,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:06,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:06,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:06,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:06,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:06,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:06,164 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-23 10:55:06,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:06,165 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2018-11-23 10:55:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:07,043 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2018-11-23 10:55:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:07,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:55:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:55:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:55:07,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 10:55:07,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:07,235 INFO L225 Difference]: With dead ends: 2316 [2018-11-23 10:55:07,235 INFO L226 Difference]: Without dead ends: 1322 [2018-11-23 10:55:07,237 INFO L631 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-23 10:55:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-11-23 10:55:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2018-11-23 10:55:08,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:08,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1322 states. Second operand 1320 states. [2018-11-23 10:55:08,322 INFO L74 IsIncluded]: Start isIncluded. First operand 1322 states. Second operand 1320 states. [2018-11-23 10:55:08,322 INFO L87 Difference]: Start difference. First operand 1322 states. Second operand 1320 states. [2018-11-23 10:55:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:08,388 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2018-11-23 10:55:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1607 transitions. [2018-11-23 10:55:08,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:08,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:08,390 INFO L74 IsIncluded]: Start isIncluded. First operand 1320 states. Second operand 1322 states. [2018-11-23 10:55:08,390 INFO L87 Difference]: Start difference. First operand 1320 states. Second operand 1322 states. [2018-11-23 10:55:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:08,456 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2018-11-23 10:55:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1607 transitions. [2018-11-23 10:55:08,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:08,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:08,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:08,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-11-23 10:55:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2018-11-23 10:55:08,515 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2018-11-23 10:55:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:08,516 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2018-11-23 10:55:08,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2018-11-23 10:55:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:08,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:08,517 INFO L402 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-23 10:55:08,517 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:08,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2018-11-23 10:55:08,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:08,518 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-23 10:55:08,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:08,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:08,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {30391#true} call ULTIMATE.init(); {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {30391#true} assume true; {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30391#true} {30391#true} #146#return; {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L256 TraceCheckUtils]: 3: Hoare triple {30391#true} call #t~ret8 := main(); {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L273 TraceCheckUtils]: 4: Hoare triple {30391#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;havoc ~cond~0; {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {30391#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {30391#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {30391#true} is VALID [2018-11-23 10:55:08,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {30391#true} assume !(0bv32 != ~p1~0); {30391#true} is VALID [2018-11-23 10:55:08,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {30391#true} assume !(0bv32 != ~p2~0); {30391#true} is VALID [2018-11-23 10:55:08,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {30391#true} assume !(0bv32 != ~p3~0); {30391#true} is VALID [2018-11-23 10:55:08,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {30391#true} assume !(0bv32 != ~p4~0); {30391#true} is VALID [2018-11-23 10:55:08,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {30391#true} assume !(0bv32 != ~p5~0); {30391#true} is VALID [2018-11-23 10:55:08,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {30391#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {30432#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:55:08,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {30432#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {30392#false} is VALID [2018-11-23 10:55:08,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {30392#false} assume 0bv32 != ~p7~0; {30392#false} is VALID [2018-11-23 10:55:08,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {30392#false} assume 1bv32 != ~lk7~0; {30392#false} is VALID [2018-11-23 10:55:08,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {30392#false} assume !false; {30392#false} is VALID [2018-11-23 10:55:08,617 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-23 10:55:08,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:08,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:08,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:08,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:08,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:08,642 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-23 10:55:08,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:08,643 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2018-11-23 10:55:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:10,112 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2018-11-23 10:55:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:10,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 10:55:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 10:55:10,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2018-11-23 10:55:10,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:10,313 INFO L225 Difference]: With dead ends: 1980 [2018-11-23 10:55:10,313 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 10:55:10,314 INFO L631 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-23 10:55:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 10:55:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-23 10:55:11,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:11,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1352 states. [2018-11-23 10:55:11,216 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1352 states. [2018-11-23 10:55:11,216 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1352 states. [2018-11-23 10:55:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:11,273 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2018-11-23 10:55:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1607 transitions. [2018-11-23 10:55:11,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:11,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:11,275 INFO L74 IsIncluded]: Start isIncluded. First operand 1352 states. Second operand 1354 states. [2018-11-23 10:55:11,275 INFO L87 Difference]: Start difference. First operand 1352 states. Second operand 1354 states. [2018-11-23 10:55:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:11,335 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2018-11-23 10:55:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1607 transitions. [2018-11-23 10:55:11,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:11,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:11,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:11,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-23 10:55:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2018-11-23 10:55:11,390 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2018-11-23 10:55:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2018-11-23 10:55:11,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2018-11-23 10:55:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:11,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:11,392 INFO L402 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-23 10:55:11,392 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:11,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2018-11-23 10:55:11,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:11,392 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-23 10:55:11,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:11,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:11,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {36676#true} call ULTIMATE.init(); {36676#true} is VALID [2018-11-23 10:55:11,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {36676#true} assume true; {36676#true} is VALID [2018-11-23 10:55:11,488 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36676#true} {36676#true} #146#return; {36676#true} is VALID [2018-11-23 10:55:11,489 INFO L256 TraceCheckUtils]: 3: Hoare triple {36676#true} call #t~ret8 := main(); {36676#true} is VALID [2018-11-23 10:55:11,489 INFO L273 TraceCheckUtils]: 4: Hoare triple {36676#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;havoc ~cond~0; {36676#true} is VALID [2018-11-23 10:55:11,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {36676#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {36676#true} is VALID [2018-11-23 10:55:11,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {36676#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {36676#true} is VALID [2018-11-23 10:55:11,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {36676#true} assume !(0bv32 != ~p1~0); {36676#true} is VALID [2018-11-23 10:55:11,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {36676#true} assume !(0bv32 != ~p2~0); {36676#true} is VALID [2018-11-23 10:55:11,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {36676#true} assume !(0bv32 != ~p3~0); {36676#true} is VALID [2018-11-23 10:55:11,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {36676#true} assume !(0bv32 != ~p4~0); {36676#true} is VALID [2018-11-23 10:55:11,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {36676#true} assume !(0bv32 != ~p5~0); {36676#true} is VALID [2018-11-23 10:55:11,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {36676#true} assume !(0bv32 != ~p6~0); {36676#true} is VALID [2018-11-23 10:55:11,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {36676#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:11,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {36720#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {36677#false} is VALID [2018-11-23 10:55:11,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {36677#false} assume !false; {36677#false} is VALID [2018-11-23 10:55:11,504 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-23 10:55:11,504 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:11,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:11,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:11,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:11,528 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-23 10:55:11,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:11,529 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2018-11-23 10:55:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:13,927 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2018-11-23 10:55:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:13,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 10:55:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 10:55:13,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 10:55:14,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:14,198 INFO L225 Difference]: With dead ends: 2186 [2018-11-23 10:55:14,198 INFO L226 Difference]: Without dead ends: 2184 [2018-11-23 10:55:14,199 INFO L631 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-23 10:55:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-11-23 10:55:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2018-11-23 10:55:14,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:14,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2184 states. Second operand 2056 states. [2018-11-23 10:55:14,880 INFO L74 IsIncluded]: Start isIncluded. First operand 2184 states. Second operand 2056 states. [2018-11-23 10:55:14,880 INFO L87 Difference]: Start difference. First operand 2184 states. Second operand 2056 states. [2018-11-23 10:55:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:15,051 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2018-11-23 10:55:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2502 transitions. [2018-11-23 10:55:15,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:15,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:15,053 INFO L74 IsIncluded]: Start isIncluded. First operand 2056 states. Second operand 2184 states. [2018-11-23 10:55:15,054 INFO L87 Difference]: Start difference. First operand 2056 states. Second operand 2184 states. [2018-11-23 10:55:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:15,214 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2018-11-23 10:55:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2502 transitions. [2018-11-23 10:55:15,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:15,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:15,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:15,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-23 10:55:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2018-11-23 10:55:15,361 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2018-11-23 10:55:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:15,362 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2018-11-23 10:55:15,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2018-11-23 10:55:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:55:15,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:15,364 INFO L402 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-23 10:55:15,364 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:15,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2018-11-23 10:55:15,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:15,364 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-23 10:55:15,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:15,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:15,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {45562#true} call ULTIMATE.init(); {45562#true} is VALID [2018-11-23 10:55:15,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {45562#true} assume true; {45562#true} is VALID [2018-11-23 10:55:15,447 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {45562#true} {45562#true} #146#return; {45562#true} is VALID [2018-11-23 10:55:15,447 INFO L256 TraceCheckUtils]: 3: Hoare triple {45562#true} call #t~ret8 := main(); {45562#true} is VALID [2018-11-23 10:55:15,449 INFO L273 TraceCheckUtils]: 4: Hoare triple {45562#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;havoc ~cond~0; {45562#true} is VALID [2018-11-23 10:55:15,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {45562#true} assume !false;~cond~0 := #t~nondet7;havoc #t~nondet7; {45562#true} is VALID [2018-11-23 10:55:15,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {45562#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32; {45562#true} is VALID [2018-11-23 10:55:15,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {45562#true} assume !(0bv32 != ~p1~0); {45562#true} is VALID [2018-11-23 10:55:15,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {45562#true} assume !(0bv32 != ~p2~0); {45562#true} is VALID [2018-11-23 10:55:15,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {45562#true} assume !(0bv32 != ~p3~0); {45562#true} is VALID [2018-11-23 10:55:15,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {45562#true} assume !(0bv32 != ~p4~0); {45562#true} is VALID [2018-11-23 10:55:15,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {45562#true} assume !(0bv32 != ~p5~0); {45562#true} is VALID [2018-11-23 10:55:15,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {45562#true} assume !(0bv32 != ~p6~0); {45562#true} is VALID [2018-11-23 10:55:15,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {45562#true} assume !(0bv32 != ~p7~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {45606#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:15,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {45606#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {45563#false} is VALID [2018-11-23 10:55:15,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {45563#false} assume 1bv32 != ~lk7~0; {45563#false} is VALID [2018-11-23 10:55:15,459 INFO L273 TraceCheckUtils]: 22: Hoare triple {45563#false} assume !false; {45563#false} is VALID [2018-11-23 10:55:15,460 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-23 10:55:15,460 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:15,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:15,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:15,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:15,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:15,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:15,483 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-23 10:55:15,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:15,484 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2018-11-23 10:55:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:17,511 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2018-11-23 10:55:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:17,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:55:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 10:55:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 10:55:17,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2018-11-23 10:55:17,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:17,641 INFO L225 Difference]: With dead ends: 4552 [2018-11-23 10:55:17,641 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:55:17,649 INFO L631 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-23 10:55:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:55:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:55:17,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:17,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:17,649 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:17,650 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:17,650 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:55:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:55:17,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:17,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:17,650 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:17,651 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:55:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:17,651 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:55:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:55:17,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:17,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:17,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:17,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:55:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:55:17,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-23 10:55:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:17,652 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:55:17,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:55:17,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:17,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:55:17,900 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:55:17,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:55:17,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:55:17,900 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:55:17,900 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:55:17,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:55:17,901 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-23 10:55:17,901 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-23 10:55:17,901 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,901 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-23 10:55:17,901 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-23 10:55:17,901 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-23 10:55:17,901 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-23 10:55:17,901 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-23 10:55:17,902 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,903 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 10:55:17,905 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:55:17,905 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:55:17,905 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:55:17,905 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 10:55:17,905 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:55:17,905 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 10:55:17,906 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:55:17,907 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2018-11-23 10:55:17,908 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-23 10:55:17,909 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-23 10:55:17,909 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:55:17,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:55:17 BoogieIcfgContainer [2018-11-23 10:55:17,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:55:17,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:55:17,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:55:17,915 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:55:17,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:45" (3/4) ... [2018-11-23 10:55:17,919 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:55:17,924 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:55:17,925 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:55:17,931 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:55:17,931 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:55:17,931 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:55:17,995 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 10:55:17,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:55:17,997 INFO L168 Benchmark]: Toolchain (without parser) took 34391.33 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -601.1 MB). Peak memory consumption was 488.3 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:18,000 INFO L168 Benchmark]: CDTParser took 0.28 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-23 10:55:18,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.13 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-23 10:55:18,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.26 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-23 10:55:18,001 INFO L168 Benchmark]: Boogie Preprocessor took 61.65 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-23 10:55:18,002 INFO L168 Benchmark]: RCFGBuilder took 919.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:18,002 INFO L168 Benchmark]: TraceAbstraction took 32892.62 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 344.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 165.5 MB). Peak memory consumption was 510.0 MB. Max. memory is 7.1 GB. [2018-11-23 10:55:18,003 INFO L168 Benchmark]: Witness Printer took 80.33 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:55:18,005 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.28 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. * CACSL2BoogieTranslator took 396.13 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 Procedure Inliner took 31.26 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. * Boogie Preprocessor took 61.65 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 919.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32892.62 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 344.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 165.5 MB). Peak memory consumption was 510.0 MB. Max. memory is 7.1 GB. * Witness Printer took 80.33 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 35 locations, 1 error locations. SAFE Result, 32.8s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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: 7.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 15984 SizeOfPredicates, 7 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...