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_12_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:09,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:09,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:09,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:09,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:09,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:09,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:09,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:09,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:09,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:09,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:09,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:09,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:09,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:09,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:09,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:09,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:09,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:09,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:09,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:09,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:09,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:09,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:09,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:09,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:09,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:09,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:09,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:09,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:09,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:09,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:09,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:09,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:09,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:09,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:09,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:09,918 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:09,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:09,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:09,942 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:09,942 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:09,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:09,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:09,943 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:09,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:09,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:09,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:09,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:09,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:09,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:09,946 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:09,946 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:09,946 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:09,946 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:09,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:09,947 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:09,947 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:09,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:09,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:09,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:09,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:09,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:09,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:09,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:09,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:09,950 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:09,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:09,951 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:09,951 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:09,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:10,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:10,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:10,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:10,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:10,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:10,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:10,108 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc166b73/3e906539c9934e8fa813aeb21eef486c/FLAG51852f620 [2018-11-23 10:54:10,591 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:10,592 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:10,601 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc166b73/3e906539c9934e8fa813aeb21eef486c/FLAG51852f620 [2018-11-23 10:54:10,944 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc166b73/3e906539c9934e8fa813aeb21eef486c [2018-11-23 10:54:10,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:10,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:10,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:10,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:10,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:10,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:10" (1/1) ... [2018-11-23 10:54:10,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2541e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:10, skipping insertion in model container [2018-11-23 10:54:10,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:10" (1/1) ... [2018-11-23 10:54:10,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:11,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:11,338 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:11,348 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:11,392 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:11,406 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:11,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:11 WrapperNode [2018-11-23 10:54:11,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:11,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:11,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:11,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:11,417 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:11" (1/1) ... [2018-11-23 10:54:11,425 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:11" (1/1) ... [2018-11-23 10:54:11,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:11,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:11,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:11,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:11,444 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:11" (1/1) ... [2018-11-23 10:54:11,444 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:11" (1/1) ... [2018-11-23 10:54:11,446 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:11" (1/1) ... [2018-11-23 10:54:11,447 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:11" (1/1) ... [2018-11-23 10:54:11,458 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:11" (1/1) ... [2018-11-23 10:54:11,471 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:11" (1/1) ... [2018-11-23 10:54:11,473 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:11" (1/1) ... [2018-11-23 10:54:11,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:11,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:11,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:11,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:11,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:11" (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:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:11,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:12,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:12,690 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:12,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:12 BoogieIcfgContainer [2018-11-23 10:54:12,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:12,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:12,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:12,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:12,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:10" (1/3) ... [2018-11-23 10:54:12,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb75bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:12, skipping insertion in model container [2018-11-23 10:54:12,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:11" (2/3) ... [2018-11-23 10:54:12,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb75bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:12, skipping insertion in model container [2018-11-23 10:54:12,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:12" (3/3) ... [2018-11-23 10:54:12,699 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:12,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:12,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:12,732 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:12,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:12,768 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:12,768 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:12,768 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:12,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:12,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:12,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:12,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:12,772 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 10:54:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:54:12,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:12,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, 1] [2018-11-23 10:54:12,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:12,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:12,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-11-23 10:54:12,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:12,819 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:12,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:12,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:13,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 10:54:13,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 10:54:13,266 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #231#return; {53#true} is VALID [2018-11-23 10:54:13,267 INFO L256 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret13 := main(); {53#true} is VALID [2018-11-23 10:54:13,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {53#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {53#true} is VALID [2018-11-23 10:54:13,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {53#true} is VALID [2018-11-23 10:54:13,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {53#true} is VALID [2018-11-23 10:54:13,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:13,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {79#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {54#false} is VALID [2018-11-23 10:54:13,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 10:54:13,336 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:13,336 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:13,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:13,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:13,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:54:13,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:13,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:13,431 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:54:13,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:13,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:13,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:13,444 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 10:54:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:14,477 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-11-23 10:54:14,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:14,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:54:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 10:54:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 10:54:14,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 10:54:15,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:15,045 INFO L225 Difference]: With dead ends: 99 [2018-11-23 10:54:15,045 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 10:54:15,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 10:54:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-23 10:54:15,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:15,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 58 states. [2018-11-23 10:54:15,090 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 58 states. [2018-11-23 10:54:15,090 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 58 states. [2018-11-23 10:54:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:15,102 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2018-11-23 10:54:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 152 transitions. [2018-11-23 10:54:15,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:15,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:15,104 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 84 states. [2018-11-23 10:54:15,106 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 84 states. [2018-11-23 10:54:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:15,115 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2018-11-23 10:54:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 152 transitions. [2018-11-23 10:54:15,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:15,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:15,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:15,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:54:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-11-23 10:54:15,124 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-11-23 10:54:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:15,124 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-11-23 10:54:15,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-11-23 10:54:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:54:15,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:15,126 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:54:15,126 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:15,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-11-23 10:54:15,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:15,128 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:15,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:15,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:15,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2018-11-23 10:54:15,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {464#true} assume true; {464#true} is VALID [2018-11-23 10:54:15,287 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {464#true} {464#true} #231#return; {464#true} is VALID [2018-11-23 10:54:15,287 INFO L256 TraceCheckUtils]: 3: Hoare triple {464#true} call #t~ret13 := main(); {464#true} is VALID [2018-11-23 10:54:15,287 INFO L273 TraceCheckUtils]: 4: Hoare triple {464#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {464#true} is VALID [2018-11-23 10:54:15,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {464#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {464#true} is VALID [2018-11-23 10:54:15,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {464#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {464#true} is VALID [2018-11-23 10:54:15,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {464#true} assume !(0bv32 != ~p1~0); {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {490#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:15,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {490#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {465#false} is VALID [2018-11-23 10:54:15,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {465#false} assume 1bv32 != ~lk1~0; {465#false} is VALID [2018-11-23 10:54:15,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {465#false} assume !false; {465#false} is VALID [2018-11-23 10:54:15,310 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:15,311 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:15,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:15,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:15,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:54:15,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:15,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:15,397 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:54:15,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:15,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:15,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:15,398 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-11-23 10:54:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:15,759 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-11-23 10:54:15,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:15,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:54:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 10:54:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-23 10:54:15,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-23 10:54:16,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:16,156 INFO L225 Difference]: With dead ends: 137 [2018-11-23 10:54:16,156 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 10:54:16,158 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:54:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 10:54:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 10:54:16,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:16,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-23 10:54:16,186 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-23 10:54:16,186 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-23 10:54:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:16,191 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2018-11-23 10:54:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 150 transitions. [2018-11-23 10:54:16,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:16,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:16,193 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-23 10:54:16,193 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-23 10:54:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:16,199 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2018-11-23 10:54:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 150 transitions. [2018-11-23 10:54:16,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:16,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:16,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:16,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 10:54:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-11-23 10:54:16,206 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-11-23 10:54:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:16,206 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-11-23 10:54:16,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-11-23 10:54:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:54:16,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:16,208 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:54:16,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:16,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-11-23 10:54:16,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:16,209 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:16,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:16,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:16,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {936#true} is VALID [2018-11-23 10:54:16,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {936#true} assume true; {936#true} is VALID [2018-11-23 10:54:16,354 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {936#true} {936#true} #231#return; {936#true} is VALID [2018-11-23 10:54:16,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {936#true} call #t~ret13 := main(); {936#true} is VALID [2018-11-23 10:54:16,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {936#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {936#true} is VALID [2018-11-23 10:54:16,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {936#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {936#true} is VALID [2018-11-23 10:54:16,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {936#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {936#true} is VALID [2018-11-23 10:54:16,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {936#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {962#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:16,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {962#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {937#false} is VALID [2018-11-23 10:54:16,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {937#false} assume 0bv32 != ~p2~0; {937#false} is VALID [2018-11-23 10:54:16,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {937#false} assume 1bv32 != ~lk2~0; {937#false} is VALID [2018-11-23 10:54:16,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {937#false} assume !false; {937#false} is VALID [2018-11-23 10:54:16,376 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:16,376 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:16,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:16,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:16,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:16,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:16,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:16,410 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:54:16,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:16,412 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-11-23 10:54:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:16,743 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-11-23 10:54:16,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:16,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 10:54:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-23 10:54:16,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 222 transitions. [2018-11-23 10:54:17,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:17,098 INFO L225 Difference]: With dead ends: 126 [2018-11-23 10:54:17,098 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 10:54:17,099 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:54:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 10:54:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 10:54:17,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:17,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 10:54:17,159 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 10:54:17,159 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 10:54:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:17,163 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-23 10:54:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 152 transitions. [2018-11-23 10:54:17,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:17,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:17,165 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 10:54:17,165 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 10:54:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:17,170 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-23 10:54:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 152 transitions. [2018-11-23 10:54:17,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:17,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:17,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:17,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 10:54:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-11-23 10:54:17,176 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-11-23 10:54:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:17,176 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-11-23 10:54:17,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-11-23 10:54:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:54:17,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:17,177 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:54:17,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:17,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-11-23 10:54:17,179 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:17,179 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:17,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:17,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:17,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {1411#true} call ULTIMATE.init(); {1411#true} is VALID [2018-11-23 10:54:17,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {1411#true} assume true; {1411#true} is VALID [2018-11-23 10:54:17,310 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1411#true} {1411#true} #231#return; {1411#true} is VALID [2018-11-23 10:54:17,311 INFO L256 TraceCheckUtils]: 3: Hoare triple {1411#true} call #t~ret13 := main(); {1411#true} is VALID [2018-11-23 10:54:17,311 INFO L273 TraceCheckUtils]: 4: Hoare triple {1411#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {1411#true} is VALID [2018-11-23 10:54:17,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {1411#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {1411#true} is VALID [2018-11-23 10:54:17,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {1411#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {1411#true} is VALID [2018-11-23 10:54:17,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {1411#true} assume !(0bv32 != ~p1~0); {1411#true} is VALID [2018-11-23 10:54:17,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {1411#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:17,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {1440#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1412#false} is VALID [2018-11-23 10:54:17,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {1412#false} assume !false; {1412#false} is VALID [2018-11-23 10:54:17,330 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:17,330 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:17,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:17,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:17,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:17,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:17,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:17,361 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:54:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:17,363 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-11-23 10:54:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:17,613 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-11-23 10:54:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:17,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:54:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 10:54:17,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 10:54:17,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:17,801 INFO L225 Difference]: With dead ends: 160 [2018-11-23 10:54:17,801 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 10:54:17,802 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:54:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 10:54:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-23 10:54:17,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:17,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 112 states. [2018-11-23 10:54:17,840 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 112 states. [2018-11-23 10:54:17,840 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 112 states. [2018-11-23 10:54:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:17,847 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2018-11-23 10:54:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 285 transitions. [2018-11-23 10:54:17,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:17,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:17,849 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 158 states. [2018-11-23 10:54:17,849 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 158 states. [2018-11-23 10:54:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:17,856 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2018-11-23 10:54:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 285 transitions. [2018-11-23 10:54:17,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:17,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:17,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:17,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 10:54:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-11-23 10:54:17,863 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-11-23 10:54:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:17,863 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-11-23 10:54:17,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-11-23 10:54:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:54:17,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:17,864 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:54:17,865 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:17,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-11-23 10:54:17,866 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:17,866 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:17,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:17,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:17,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {2090#true} call ULTIMATE.init(); {2090#true} is VALID [2018-11-23 10:54:17,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {2090#true} assume true; {2090#true} is VALID [2018-11-23 10:54:17,996 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2090#true} {2090#true} #231#return; {2090#true} is VALID [2018-11-23 10:54:17,996 INFO L256 TraceCheckUtils]: 3: Hoare triple {2090#true} call #t~ret13 := main(); {2090#true} is VALID [2018-11-23 10:54:17,997 INFO L273 TraceCheckUtils]: 4: Hoare triple {2090#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {2090#true} is VALID [2018-11-23 10:54:17,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {2090#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {2090#true} is VALID [2018-11-23 10:54:17,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {2090#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {2090#true} is VALID [2018-11-23 10:54:17,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {2090#true} assume !(0bv32 != ~p1~0); {2090#true} is VALID [2018-11-23 10:54:17,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {2090#true} assume !(0bv32 != ~p2~0); {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {2119#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:18,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {2119#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {2091#false} is VALID [2018-11-23 10:54:18,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {2091#false} assume 1bv32 != ~lk2~0; {2091#false} is VALID [2018-11-23 10:54:18,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {2091#false} assume !false; {2091#false} is VALID [2018-11-23 10:54:18,019 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:18,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:18,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:18,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:18,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:18,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:18,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:18,056 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:54:18,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:18,057 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-11-23 10:54:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:18,298 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-11-23 10:54:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:18,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:54:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-23 10:54:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-23 10:54:18,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2018-11-23 10:54:18,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:18,784 INFO L225 Difference]: With dead ends: 264 [2018-11-23 10:54:18,784 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 10:54:18,785 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:54:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 10:54:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-23 10:54:18,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:18,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-23 10:54:18,856 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-23 10:54:18,856 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-23 10:54:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:18,863 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2018-11-23 10:54:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 283 transitions. [2018-11-23 10:54:18,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:18,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:18,865 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-23 10:54:18,865 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-23 10:54:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:18,871 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2018-11-23 10:54:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 283 transitions. [2018-11-23 10:54:18,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:18,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:18,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:18,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 10:54:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-11-23 10:54:18,879 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-11-23 10:54:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:18,879 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-11-23 10:54:18,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-23 10:54:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:18,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:18,880 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, 1] [2018-11-23 10:54:18,881 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:18,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-11-23 10:54:18,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:18,881 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:18,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:18,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:18,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {2927#true} call ULTIMATE.init(); {2927#true} is VALID [2018-11-23 10:54:18,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {2927#true} assume true; {2927#true} is VALID [2018-11-23 10:54:18,998 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2927#true} {2927#true} #231#return; {2927#true} is VALID [2018-11-23 10:54:18,998 INFO L256 TraceCheckUtils]: 3: Hoare triple {2927#true} call #t~ret13 := main(); {2927#true} is VALID [2018-11-23 10:54:18,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {2927#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {2927#true} is VALID [2018-11-23 10:54:18,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {2927#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {2927#true} is VALID [2018-11-23 10:54:18,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {2927#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {2927#true} is VALID [2018-11-23 10:54:18,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {2927#true} assume !(0bv32 != ~p1~0); {2927#true} is VALID [2018-11-23 10:54:19,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {2927#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {2956#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:19,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {2956#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {2928#false} is VALID [2018-11-23 10:54:19,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {2928#false} assume 0bv32 != ~p3~0; {2928#false} is VALID [2018-11-23 10:54:19,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {2928#false} assume 1bv32 != ~lk3~0; {2928#false} is VALID [2018-11-23 10:54:19,057 INFO L273 TraceCheckUtils]: 23: Hoare triple {2928#false} assume !false; {2928#false} is VALID [2018-11-23 10:54:19,059 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:19,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:19,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:19,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:19,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:19,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:19,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:19,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:19,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:19,122 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-11-23 10:54:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:19,425 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-11-23 10:54:19,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:19,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-23 10:54:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2018-11-23 10:54:19,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2018-11-23 10:54:19,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:19,721 INFO L225 Difference]: With dead ends: 237 [2018-11-23 10:54:19,721 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 10:54:19,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 10:54:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 10:54:19,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:19,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2018-11-23 10:54:19,993 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2018-11-23 10:54:19,993 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2018-11-23 10:54:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,009 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2018-11-23 10:54:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 283 transitions. [2018-11-23 10:54:20,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:20,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:20,011 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2018-11-23 10:54:20,011 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2018-11-23 10:54:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,022 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2018-11-23 10:54:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 283 transitions. [2018-11-23 10:54:20,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:20,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:20,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:20,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 10:54:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-11-23 10:54:20,037 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-11-23 10:54:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:20,037 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-11-23 10:54:20,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-11-23 10:54:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:20,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:20,038 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, 1] [2018-11-23 10:54:20,039 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:20,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-11-23 10:54:20,039 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:20,040 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:20,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:20,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:20,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {3746#true} call ULTIMATE.init(); {3746#true} is VALID [2018-11-23 10:54:20,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {3746#true} assume true; {3746#true} is VALID [2018-11-23 10:54:20,383 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3746#true} {3746#true} #231#return; {3746#true} is VALID [2018-11-23 10:54:20,383 INFO L256 TraceCheckUtils]: 3: Hoare triple {3746#true} call #t~ret13 := main(); {3746#true} is VALID [2018-11-23 10:54:20,383 INFO L273 TraceCheckUtils]: 4: Hoare triple {3746#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {3746#true} is VALID [2018-11-23 10:54:20,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {3746#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {3746#true} is VALID [2018-11-23 10:54:20,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {3746#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {3746#true} is VALID [2018-11-23 10:54:20,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {3746#true} assume !(0bv32 != ~p1~0); {3746#true} is VALID [2018-11-23 10:54:20,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {3746#true} assume !(0bv32 != ~p2~0); {3746#true} is VALID [2018-11-23 10:54:20,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {3746#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:20,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {3778#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {3747#false} is VALID [2018-11-23 10:54:20,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {3747#false} assume !false; {3747#false} is VALID [2018-11-23 10:54:20,393 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:20,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:20,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:20,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:20,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:20,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:20,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:20,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:20,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:20,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:20,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:20,467 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-11-23 10:54:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:20,801 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-11-23 10:54:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:20,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:54:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:54:20,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 10:54:21,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:21,283 INFO L225 Difference]: With dead ends: 300 [2018-11-23 10:54:21,283 INFO L226 Difference]: Without dead ends: 298 [2018-11-23 10:54:21,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-23 10:54:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-11-23 10:54:21,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:21,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand 216 states. [2018-11-23 10:54:21,362 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand 216 states. [2018-11-23 10:54:21,362 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 216 states. [2018-11-23 10:54:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,371 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2018-11-23 10:54:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 531 transitions. [2018-11-23 10:54:21,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:21,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:21,373 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 298 states. [2018-11-23 10:54:21,373 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 298 states. [2018-11-23 10:54:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:21,382 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2018-11-23 10:54:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 531 transitions. [2018-11-23 10:54:21,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:21,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:21,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:21,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-23 10:54:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-11-23 10:54:21,389 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-11-23 10:54:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:21,389 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-11-23 10:54:21,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-11-23 10:54:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:21,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:21,391 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, 1] [2018-11-23 10:54:21,391 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:21,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-11-23 10:54:21,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:21,392 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:21,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:21,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:22,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {4958#true} call ULTIMATE.init(); {4958#true} is VALID [2018-11-23 10:54:22,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {4958#true} assume true; {4958#true} is VALID [2018-11-23 10:54:22,017 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4958#true} {4958#true} #231#return; {4958#true} is VALID [2018-11-23 10:54:22,018 INFO L256 TraceCheckUtils]: 3: Hoare triple {4958#true} call #t~ret13 := main(); {4958#true} is VALID [2018-11-23 10:54:22,018 INFO L273 TraceCheckUtils]: 4: Hoare triple {4958#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {4958#true} is VALID [2018-11-23 10:54:22,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {4958#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {4958#true} is VALID [2018-11-23 10:54:22,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {4958#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {4958#true} is VALID [2018-11-23 10:54:22,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {4958#true} assume !(0bv32 != ~p1~0); {4958#true} is VALID [2018-11-23 10:54:22,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#true} assume !(0bv32 != ~p2~0); {4958#true} is VALID [2018-11-23 10:54:22,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#true} assume !(0bv32 != ~p3~0); {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {4990#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:22,033 INFO L273 TraceCheckUtils]: 21: Hoare triple {4990#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {4959#false} is VALID [2018-11-23 10:54:22,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {4959#false} assume 1bv32 != ~lk3~0; {4959#false} is VALID [2018-11-23 10:54:22,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {4959#false} assume !false; {4959#false} is VALID [2018-11-23 10:54:22,034 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:22,034 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:22,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:22,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:22,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:22,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:22,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:22,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:22,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:22,096 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-11-23 10:54:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:22,544 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-11-23 10:54:22,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:22,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2018-11-23 10:54:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2018-11-23 10:54:22,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2018-11-23 10:54:23,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:23,269 INFO L225 Difference]: With dead ends: 512 [2018-11-23 10:54:23,269 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 10:54:23,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 10:54:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 10:54:23,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:23,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 304 states. [2018-11-23 10:54:23,370 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 304 states. [2018-11-23 10:54:23,370 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 304 states. [2018-11-23 10:54:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:23,381 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2018-11-23 10:54:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 531 transitions. [2018-11-23 10:54:23,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:23,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:23,383 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 306 states. [2018-11-23 10:54:23,383 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 306 states. [2018-11-23 10:54:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:23,392 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2018-11-23 10:54:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 531 transitions. [2018-11-23 10:54:23,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:23,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:23,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:23,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 10:54:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-11-23 10:54:23,403 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-11-23 10:54:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:23,403 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-11-23 10:54:23,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-11-23 10:54:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:23,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:23,405 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, 1, 1] [2018-11-23 10:54:23,405 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:23,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-11-23 10:54:23,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:23,406 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:23,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:23,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:23,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {6494#true} call ULTIMATE.init(); {6494#true} is VALID [2018-11-23 10:54:23,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {6494#true} assume true; {6494#true} is VALID [2018-11-23 10:54:23,817 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6494#true} {6494#true} #231#return; {6494#true} is VALID [2018-11-23 10:54:23,817 INFO L256 TraceCheckUtils]: 3: Hoare triple {6494#true} call #t~ret13 := main(); {6494#true} is VALID [2018-11-23 10:54:23,818 INFO L273 TraceCheckUtils]: 4: Hoare triple {6494#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {6494#true} is VALID [2018-11-23 10:54:23,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {6494#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {6494#true} is VALID [2018-11-23 10:54:23,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {6494#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {6494#true} is VALID [2018-11-23 10:54:23,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {6494#true} assume !(0bv32 != ~p1~0); {6494#true} is VALID [2018-11-23 10:54:23,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {6494#true} assume !(0bv32 != ~p2~0); {6494#true} is VALID [2018-11-23 10:54:23,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {6494#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {6526#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:23,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {6526#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {6495#false} is VALID [2018-11-23 10:54:23,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {6495#false} assume 0bv32 != ~p4~0; {6495#false} is VALID [2018-11-23 10:54:23,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {6495#false} assume 1bv32 != ~lk4~0; {6495#false} is VALID [2018-11-23 10:54:23,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {6495#false} assume !false; {6495#false} is VALID [2018-11-23 10:54:23,885 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:23,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:23,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:23,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:23,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:23,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:23,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:24,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:24,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:24,018 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-11-23 10:54:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:24,428 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-11-23 10:54:24,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:24,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2018-11-23 10:54:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2018-11-23 10:54:24,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2018-11-23 10:54:25,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:25,021 INFO L225 Difference]: With dead ends: 456 [2018-11-23 10:54:25,021 INFO L226 Difference]: Without dead ends: 310 [2018-11-23 10:54:25,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-23 10:54:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-11-23 10:54:25,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:25,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand 308 states. [2018-11-23 10:54:25,088 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand 308 states. [2018-11-23 10:54:25,088 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 308 states. [2018-11-23 10:54:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:25,097 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2018-11-23 10:54:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 531 transitions. [2018-11-23 10:54:25,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:25,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:25,099 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 310 states. [2018-11-23 10:54:25,099 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 310 states. [2018-11-23 10:54:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:25,109 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2018-11-23 10:54:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 531 transitions. [2018-11-23 10:54:25,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:25,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:25,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:25,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-23 10:54:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-11-23 10:54:25,118 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-11-23 10:54:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:25,118 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-11-23 10:54:25,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-11-23 10:54:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:25,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:25,120 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, 1, 1] [2018-11-23 10:54:25,120 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:25,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-11-23 10:54:25,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:25,121 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:25,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:25,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:25,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {7989#true} call ULTIMATE.init(); {7989#true} is VALID [2018-11-23 10:54:25,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {7989#true} assume true; {7989#true} is VALID [2018-11-23 10:54:25,529 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7989#true} {7989#true} #231#return; {7989#true} is VALID [2018-11-23 10:54:25,529 INFO L256 TraceCheckUtils]: 3: Hoare triple {7989#true} call #t~ret13 := main(); {7989#true} is VALID [2018-11-23 10:54:25,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {7989#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {7989#true} is VALID [2018-11-23 10:54:25,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {7989#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {7989#true} is VALID [2018-11-23 10:54:25,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {7989#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {7989#true} is VALID [2018-11-23 10:54:25,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {7989#true} assume !(0bv32 != ~p1~0); {7989#true} is VALID [2018-11-23 10:54:25,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {7989#true} assume !(0bv32 != ~p2~0); {7989#true} is VALID [2018-11-23 10:54:25,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {7989#true} assume !(0bv32 != ~p3~0); {7989#true} is VALID [2018-11-23 10:54:25,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:25,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {8024#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {7990#false} is VALID [2018-11-23 10:54:25,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {7990#false} assume !false; {7990#false} is VALID [2018-11-23 10:54:25,540 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:25,540 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:25,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:25,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:25,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:25,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:25,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:25,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:25,566 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-11-23 10:54:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:26,001 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-11-23 10:54:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:26,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 10:54:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2018-11-23 10:54:26,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2018-11-23 10:54:26,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:26,504 INFO L225 Difference]: With dead ends: 572 [2018-11-23 10:54:26,504 INFO L226 Difference]: Without dead ends: 570 [2018-11-23 10:54:26,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-23 10:54:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-11-23 10:54:26,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:26,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand 424 states. [2018-11-23 10:54:26,714 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand 424 states. [2018-11-23 10:54:26,714 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 424 states. [2018-11-23 10:54:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:26,737 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2018-11-23 10:54:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 991 transitions. [2018-11-23 10:54:26,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:26,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:26,739 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand 570 states. [2018-11-23 10:54:26,739 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 570 states. [2018-11-23 10:54:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:26,758 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2018-11-23 10:54:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 991 transitions. [2018-11-23 10:54:26,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:26,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:26,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:26,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-23 10:54:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-11-23 10:54:26,771 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-11-23 10:54:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:26,772 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-11-23 10:54:26,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-11-23 10:54:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:26,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:26,773 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, 1, 1] [2018-11-23 10:54:26,773 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:26,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-11-23 10:54:26,774 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:26,774 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:26,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:26,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:26,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {10240#true} call ULTIMATE.init(); {10240#true} is VALID [2018-11-23 10:54:26,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {10240#true} assume true; {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10240#true} {10240#true} #231#return; {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {10240#true} call #t~ret13 := main(); {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {10240#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {10240#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {10240#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {10240#true} assume !(0bv32 != ~p1~0); {10240#true} is VALID [2018-11-23 10:54:26,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {10240#true} assume !(0bv32 != ~p2~0); {10240#true} is VALID [2018-11-23 10:54:26,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {10240#true} assume !(0bv32 != ~p3~0); {10240#true} is VALID [2018-11-23 10:54:26,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {10240#true} assume !(0bv32 != ~p4~0); {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {10275#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:26,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {10275#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {10241#false} is VALID [2018-11-23 10:54:26,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {10241#false} assume 1bv32 != ~lk4~0; {10241#false} is VALID [2018-11-23 10:54:26,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {10241#false} assume !false; {10241#false} is VALID [2018-11-23 10:54:26,902 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:26,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:26,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:26,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:26,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:26,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:26,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:26,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:26,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:26,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:26,967 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-11-23 10:54:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:28,016 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-11-23 10:54:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:28,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2018-11-23 10:54:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2018-11-23 10:54:28,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 218 transitions. [2018-11-23 10:54:28,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:28,248 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 10:54:28,248 INFO L226 Difference]: Without dead ends: 594 [2018-11-23 10:54:28,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-23 10:54:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-11-23 10:54:28,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:28,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand 592 states. [2018-11-23 10:54:28,429 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand 592 states. [2018-11-23 10:54:28,430 INFO L87 Difference]: Start difference. First operand 594 states. Second operand 592 states. [2018-11-23 10:54:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:28,453 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2018-11-23 10:54:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 999 transitions. [2018-11-23 10:54:28,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:28,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:28,455 INFO L74 IsIncluded]: Start isIncluded. First operand 592 states. Second operand 594 states. [2018-11-23 10:54:28,455 INFO L87 Difference]: Start difference. First operand 592 states. Second operand 594 states. [2018-11-23 10:54:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:28,472 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2018-11-23 10:54:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 999 transitions. [2018-11-23 10:54:28,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:28,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:28,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:28,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-23 10:54:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-11-23 10:54:28,494 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-11-23 10:54:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:28,495 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-11-23 10:54:28,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-11-23 10:54:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:28,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:28,496 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, 1, 1, 1] [2018-11-23 10:54:28,496 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:28,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-11-23 10:54:28,497 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:28,497 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:28,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:28,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:28,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {13155#true} call ULTIMATE.init(); {13155#true} is VALID [2018-11-23 10:54:28,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {13155#true} assume true; {13155#true} is VALID [2018-11-23 10:54:28,641 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13155#true} {13155#true} #231#return; {13155#true} is VALID [2018-11-23 10:54:28,641 INFO L256 TraceCheckUtils]: 3: Hoare triple {13155#true} call #t~ret13 := main(); {13155#true} is VALID [2018-11-23 10:54:28,641 INFO L273 TraceCheckUtils]: 4: Hoare triple {13155#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {13155#true} is VALID [2018-11-23 10:54:28,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {13155#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {13155#true} is VALID [2018-11-23 10:54:28,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {13155#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {13155#true} is VALID [2018-11-23 10:54:28,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {13155#true} assume !(0bv32 != ~p1~0); {13155#true} is VALID [2018-11-23 10:54:28,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {13155#true} assume !(0bv32 != ~p2~0); {13155#true} is VALID [2018-11-23 10:54:28,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {13155#true} assume !(0bv32 != ~p3~0); {13155#true} is VALID [2018-11-23 10:54:28,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {13155#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {13190#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:28,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {13190#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {13156#false} is VALID [2018-11-23 10:54:28,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {13156#false} assume 0bv32 != ~p5~0; {13156#false} is VALID [2018-11-23 10:54:28,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {13156#false} assume 1bv32 != ~lk5~0; {13156#false} is VALID [2018-11-23 10:54:28,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {13156#false} assume !false; {13156#false} is VALID [2018-11-23 10:54:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:28,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:28,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:28,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:28,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:28,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:28,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:28,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:28,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:28,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:28,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:28,682 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-11-23 10:54:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,118 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-11-23 10:54:29,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:29,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2018-11-23 10:54:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2018-11-23 10:54:29,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 213 transitions. [2018-11-23 10:54:29,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:29,373 INFO L225 Difference]: With dead ends: 888 [2018-11-23 10:54:29,373 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 10:54:29,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 10:54:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 10:54:29,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:29,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand 600 states. [2018-11-23 10:54:29,951 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand 600 states. [2018-11-23 10:54:29,951 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 600 states. [2018-11-23 10:54:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,970 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2018-11-23 10:54:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 999 transitions. [2018-11-23 10:54:29,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:29,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:29,971 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand 602 states. [2018-11-23 10:54:29,971 INFO L87 Difference]: Start difference. First operand 600 states. Second operand 602 states. [2018-11-23 10:54:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,993 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2018-11-23 10:54:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 999 transitions. [2018-11-23 10:54:29,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:29,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:29,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:29,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 10:54:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-11-23 10:54:30,015 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-11-23 10:54:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:30,015 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-11-23 10:54:30,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-11-23 10:54:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:30,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:30,016 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, 1, 1, 1] [2018-11-23 10:54:30,017 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:30,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-11-23 10:54:30,017 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:30,017 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:30,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:30,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {15981#true} call ULTIMATE.init(); {15981#true} is VALID [2018-11-23 10:54:30,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {15981#true} assume true; {15981#true} is VALID [2018-11-23 10:54:30,227 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15981#true} {15981#true} #231#return; {15981#true} is VALID [2018-11-23 10:54:30,227 INFO L256 TraceCheckUtils]: 3: Hoare triple {15981#true} call #t~ret13 := main(); {15981#true} is VALID [2018-11-23 10:54:30,227 INFO L273 TraceCheckUtils]: 4: Hoare triple {15981#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {15981#true} is VALID [2018-11-23 10:54:30,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {15981#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {15981#true} is VALID [2018-11-23 10:54:30,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {15981#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {15981#true} is VALID [2018-11-23 10:54:30,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {15981#true} assume !(0bv32 != ~p1~0); {15981#true} is VALID [2018-11-23 10:54:30,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {15981#true} assume !(0bv32 != ~p2~0); {15981#true} is VALID [2018-11-23 10:54:30,228 INFO L273 TraceCheckUtils]: 9: Hoare triple {15981#true} assume !(0bv32 != ~p3~0); {15981#true} is VALID [2018-11-23 10:54:30,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {15981#true} assume !(0bv32 != ~p4~0); {15981#true} is VALID [2018-11-23 10:54:30,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {15981#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:30,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {16019#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {15982#false} is VALID [2018-11-23 10:54:30,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {15982#false} assume !false; {15982#false} is VALID [2018-11-23 10:54:30,240 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:30,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:30,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:30,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:30,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:30,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:30,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:30,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:30,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:30,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:30,271 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-11-23 10:54:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,674 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-11-23 10:54:30,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:30,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:54:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 10:54:30,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 10:54:30,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:30,953 INFO L225 Difference]: With dead ends: 1100 [2018-11-23 10:54:30,954 INFO L226 Difference]: Without dead ends: 1098 [2018-11-23 10:54:30,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-11-23 10:54:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-11-23 10:54:31,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:31,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1098 states. Second operand 840 states. [2018-11-23 10:54:31,114 INFO L74 IsIncluded]: Start isIncluded. First operand 1098 states. Second operand 840 states. [2018-11-23 10:54:31,115 INFO L87 Difference]: Start difference. First operand 1098 states. Second operand 840 states. [2018-11-23 10:54:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,158 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2018-11-23 10:54:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1847 transitions. [2018-11-23 10:54:31,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,160 INFO L74 IsIncluded]: Start isIncluded. First operand 840 states. Second operand 1098 states. [2018-11-23 10:54:31,160 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 1098 states. [2018-11-23 10:54:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,222 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2018-11-23 10:54:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1847 transitions. [2018-11-23 10:54:31,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:31,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-23 10:54:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-11-23 10:54:31,251 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-11-23 10:54:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:31,251 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-11-23 10:54:31,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-11-23 10:54:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:31,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:31,252 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, 1, 1, 1] [2018-11-23 10:54:31,252 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:31,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-11-23 10:54:31,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:31,253 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:31,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:31,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {20259#true} call ULTIMATE.init(); {20259#true} is VALID [2018-11-23 10:54:31,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {20259#true} assume true; {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20259#true} {20259#true} #231#return; {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {20259#true} call #t~ret13 := main(); {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {20259#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {20259#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {20259#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {20259#true} assume !(0bv32 != ~p1~0); {20259#true} is VALID [2018-11-23 10:54:31,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {20259#true} assume !(0bv32 != ~p2~0); {20259#true} is VALID [2018-11-23 10:54:31,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {20259#true} assume !(0bv32 != ~p3~0); {20259#true} is VALID [2018-11-23 10:54:31,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {20259#true} assume !(0bv32 != ~p4~0); {20259#true} is VALID [2018-11-23 10:54:31,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {20259#true} assume !(0bv32 != ~p5~0); {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {20297#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:31,368 INFO L273 TraceCheckUtils]: 23: Hoare triple {20297#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {20260#false} is VALID [2018-11-23 10:54:31,368 INFO L273 TraceCheckUtils]: 24: Hoare triple {20260#false} assume 1bv32 != ~lk5~0; {20260#false} is VALID [2018-11-23 10:54:31,369 INFO L273 TraceCheckUtils]: 25: Hoare triple {20260#false} assume !false; {20260#false} is VALID [2018-11-23 10:54:31,369 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:31,370 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:31,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:31,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:31,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:31,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:31,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:31,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:31,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:31,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:31,396 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-11-23 10:54:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,137 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-11-23 10:54:32,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:32,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2018-11-23 10:54:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2018-11-23 10:54:32,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2018-11-23 10:54:32,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:32,460 INFO L225 Difference]: With dead ends: 1980 [2018-11-23 10:54:32,460 INFO L226 Difference]: Without dead ends: 1162 [2018-11-23 10:54:32,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-23 10:54:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-11-23 10:54:32,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:32,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1162 states. Second operand 1160 states. [2018-11-23 10:54:32,850 INFO L74 IsIncluded]: Start isIncluded. First operand 1162 states. Second operand 1160 states. [2018-11-23 10:54:32,850 INFO L87 Difference]: Start difference. First operand 1162 states. Second operand 1160 states. [2018-11-23 10:54:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,903 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2018-11-23 10:54:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1879 transitions. [2018-11-23 10:54:32,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:32,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:32,905 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1162 states. [2018-11-23 10:54:32,905 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1162 states. [2018-11-23 10:54:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,967 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2018-11-23 10:54:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1879 transitions. [2018-11-23 10:54:32,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:32,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:32,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:32,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 10:54:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-11-23 10:54:33,012 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-11-23 10:54:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:33,012 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-11-23 10:54:33,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-11-23 10:54:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:33,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:33,013 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, 1, 1, 1, 1] [2018-11-23 10:54:33,013 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:33,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-11-23 10:54:33,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:33,013 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:54:33,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:33,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:33,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {25897#true} call ULTIMATE.init(); {25897#true} is VALID [2018-11-23 10:54:33,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {25897#true} assume true; {25897#true} is VALID [2018-11-23 10:54:33,108 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25897#true} {25897#true} #231#return; {25897#true} is VALID [2018-11-23 10:54:33,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {25897#true} call #t~ret13 := main(); {25897#true} is VALID [2018-11-23 10:54:33,109 INFO L273 TraceCheckUtils]: 4: Hoare triple {25897#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {25897#true} is VALID [2018-11-23 10:54:33,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {25897#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {25897#true} is VALID [2018-11-23 10:54:33,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {25897#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {25897#true} is VALID [2018-11-23 10:54:33,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {25897#true} assume !(0bv32 != ~p1~0); {25897#true} is VALID [2018-11-23 10:54:33,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {25897#true} assume !(0bv32 != ~p2~0); {25897#true} is VALID [2018-11-23 10:54:33,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {25897#true} assume !(0bv32 != ~p3~0); {25897#true} is VALID [2018-11-23 10:54:33,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {25897#true} assume !(0bv32 != ~p4~0); {25897#true} is VALID [2018-11-23 10:54:33,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {25897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {25935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:33,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {25935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {25898#false} is VALID [2018-11-23 10:54:33,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {25898#false} assume 0bv32 != ~p6~0; {25898#false} is VALID [2018-11-23 10:54:33,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {25898#false} assume 1bv32 != ~lk6~0; {25898#false} is VALID [2018-11-23 10:54:33,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {25898#false} assume !false; {25898#false} is VALID [2018-11-23 10:54:33,125 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:33,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:33,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:33,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:33,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:33,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:33,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:33,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:33,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:33,170 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-11-23 10:54:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:34,225 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-11-23 10:54:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:34,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-23 10:54:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2018-11-23 10:54:34,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 210 transitions. [2018-11-23 10:54:34,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:34,499 INFO L225 Difference]: With dead ends: 1740 [2018-11-23 10:54:34,499 INFO L226 Difference]: Without dead ends: 1178 [2018-11-23 10:54:34,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-23 10:54:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-11-23 10:54:34,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:34,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1178 states. Second operand 1176 states. [2018-11-23 10:54:34,933 INFO L74 IsIncluded]: Start isIncluded. First operand 1178 states. Second operand 1176 states. [2018-11-23 10:54:34,933 INFO L87 Difference]: Start difference. First operand 1178 states. Second operand 1176 states. [2018-11-23 10:54:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:34,978 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2018-11-23 10:54:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1879 transitions. [2018-11-23 10:54:34,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:34,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:34,979 INFO L74 IsIncluded]: Start isIncluded. First operand 1176 states. Second operand 1178 states. [2018-11-23 10:54:34,980 INFO L87 Difference]: Start difference. First operand 1176 states. Second operand 1178 states. [2018-11-23 10:54:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,034 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2018-11-23 10:54:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1879 transitions. [2018-11-23 10:54:35,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:35,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:35,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:35,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-23 10:54:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-11-23 10:54:35,084 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-11-23 10:54:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:35,084 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-11-23 10:54:35,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-11-23 10:54:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:35,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:35,085 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, 1, 1, 1, 1] [2018-11-23 10:54:35,086 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:35,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-11-23 10:54:35,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:35,086 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:54:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:35,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {31346#true} call ULTIMATE.init(); {31346#true} is VALID [2018-11-23 10:54:35,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {31346#true} assume true; {31346#true} is VALID [2018-11-23 10:54:35,189 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31346#true} {31346#true} #231#return; {31346#true} is VALID [2018-11-23 10:54:35,190 INFO L256 TraceCheckUtils]: 3: Hoare triple {31346#true} call #t~ret13 := main(); {31346#true} is VALID [2018-11-23 10:54:35,190 INFO L273 TraceCheckUtils]: 4: Hoare triple {31346#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {31346#true} is VALID [2018-11-23 10:54:35,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {31346#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {31346#true} is VALID [2018-11-23 10:54:35,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {31346#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {31346#true} is VALID [2018-11-23 10:54:35,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {31346#true} assume !(0bv32 != ~p1~0); {31346#true} is VALID [2018-11-23 10:54:35,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {31346#true} assume !(0bv32 != ~p2~0); {31346#true} is VALID [2018-11-23 10:54:35,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {31346#true} assume !(0bv32 != ~p3~0); {31346#true} is VALID [2018-11-23 10:54:35,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {31346#true} assume !(0bv32 != ~p4~0); {31346#true} is VALID [2018-11-23 10:54:35,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {31346#true} assume !(0bv32 != ~p5~0); {31346#true} is VALID [2018-11-23 10:54:35,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {31346#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {31387#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {31347#false} is VALID [2018-11-23 10:54:35,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {31347#false} assume !false; {31347#false} is VALID [2018-11-23 10:54:35,205 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:35,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:35,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:35,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:35,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:35,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:35,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:35,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:35,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:35,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:35,233 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-11-23 10:54:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,150 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-11-23 10:54:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:36,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:54:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 10:54:36,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 10:54:36,304 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:36,477 INFO L225 Difference]: With dead ends: 2124 [2018-11-23 10:54:36,477 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 10:54:36,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 10:54:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-11-23 10:54:36,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:36,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 1672 states. [2018-11-23 10:54:36,911 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 1672 states. [2018-11-23 10:54:36,911 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 1672 states. [2018-11-23 10:54:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,046 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2018-11-23 10:54:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3431 transitions. [2018-11-23 10:54:37,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,049 INFO L74 IsIncluded]: Start isIncluded. First operand 1672 states. Second operand 2122 states. [2018-11-23 10:54:37,049 INFO L87 Difference]: Start difference. First operand 1672 states. Second operand 2122 states. [2018-11-23 10:54:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,203 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2018-11-23 10:54:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3431 transitions. [2018-11-23 10:54:37,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:37,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-11-23 10:54:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-11-23 10:54:37,297 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-11-23 10:54:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:37,298 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-11-23 10:54:37,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-11-23 10:54:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:37,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:37,299 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, 1, 1, 1, 1] [2018-11-23 10:54:37,299 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:37,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-11-23 10:54:37,300 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:37,300 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:54:37,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:37,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {39579#true} call ULTIMATE.init(); {39579#true} is VALID [2018-11-23 10:54:37,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {39579#true} assume true; {39579#true} is VALID [2018-11-23 10:54:37,607 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {39579#true} {39579#true} #231#return; {39579#true} is VALID [2018-11-23 10:54:37,607 INFO L256 TraceCheckUtils]: 3: Hoare triple {39579#true} call #t~ret13 := main(); {39579#true} is VALID [2018-11-23 10:54:37,608 INFO L273 TraceCheckUtils]: 4: Hoare triple {39579#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {39579#true} is VALID [2018-11-23 10:54:37,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {39579#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {39579#true} is VALID [2018-11-23 10:54:37,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {39579#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {39579#true} is VALID [2018-11-23 10:54:37,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {39579#true} assume !(0bv32 != ~p1~0); {39579#true} is VALID [2018-11-23 10:54:37,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {39579#true} assume !(0bv32 != ~p2~0); {39579#true} is VALID [2018-11-23 10:54:37,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {39579#true} assume !(0bv32 != ~p3~0); {39579#true} is VALID [2018-11-23 10:54:37,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {39579#true} assume !(0bv32 != ~p4~0); {39579#true} is VALID [2018-11-23 10:54:37,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {39579#true} assume !(0bv32 != ~p5~0); {39579#true} is VALID [2018-11-23 10:54:37,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {39579#true} assume !(0bv32 != ~p6~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,621 INFO L273 TraceCheckUtils]: 22: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,623 INFO L273 TraceCheckUtils]: 23: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {39620#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:37,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {39620#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {39580#false} is VALID [2018-11-23 10:54:37,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {39580#false} assume 1bv32 != ~lk6~0; {39580#false} is VALID [2018-11-23 10:54:37,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {39580#false} assume !false; {39580#false} is VALID [2018-11-23 10:54:37,624 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:37,624 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:37,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:37,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:37,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:37,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:37,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:37,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:37,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:37,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:37,658 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-11-23 10:54:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,258 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-11-23 10:54:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:39,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-23 10:54:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2018-11-23 10:54:39,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 212 transitions. [2018-11-23 10:54:39,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,678 INFO L225 Difference]: With dead ends: 3916 [2018-11-23 10:54:39,678 INFO L226 Difference]: Without dead ends: 2282 [2018-11-23 10:54:39,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-11-23 10:54:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-11-23 10:54:40,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2282 states. Second operand 2280 states. [2018-11-23 10:54:40,238 INFO L74 IsIncluded]: Start isIncluded. First operand 2282 states. Second operand 2280 states. [2018-11-23 10:54:40,238 INFO L87 Difference]: Start difference. First operand 2282 states. Second operand 2280 states. [2018-11-23 10:54:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,432 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2018-11-23 10:54:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3527 transitions. [2018-11-23 10:54:40,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,435 INFO L74 IsIncluded]: Start isIncluded. First operand 2280 states. Second operand 2282 states. [2018-11-23 10:54:40,435 INFO L87 Difference]: Start difference. First operand 2280 states. Second operand 2282 states. [2018-11-23 10:54:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,637 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2018-11-23 10:54:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3527 transitions. [2018-11-23 10:54:40,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-23 10:54:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-11-23 10:54:40,830 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-11-23 10:54:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:40,830 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-11-23 10:54:40,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-11-23 10:54:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:40,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:40,832 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, 1, 1, 1, 1, 1] [2018-11-23 10:54:40,832 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:40,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-11-23 10:54:40,833 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:40,833 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:54:40,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:40,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {50596#true} call ULTIMATE.init(); {50596#true} is VALID [2018-11-23 10:54:40,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {50596#true} assume true; {50596#true} is VALID [2018-11-23 10:54:40,932 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50596#true} {50596#true} #231#return; {50596#true} is VALID [2018-11-23 10:54:40,932 INFO L256 TraceCheckUtils]: 3: Hoare triple {50596#true} call #t~ret13 := main(); {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 4: Hoare triple {50596#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {50596#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {50596#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {50596#true} assume !(0bv32 != ~p1~0); {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {50596#true} assume !(0bv32 != ~p2~0); {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {50596#true} assume !(0bv32 != ~p3~0); {50596#true} is VALID [2018-11-23 10:54:40,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {50596#true} assume !(0bv32 != ~p4~0); {50596#true} is VALID [2018-11-23 10:54:40,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {50596#true} assume !(0bv32 != ~p5~0); {50596#true} is VALID [2018-11-23 10:54:40,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {50596#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {50637#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:40,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {50637#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {50597#false} is VALID [2018-11-23 10:54:40,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {50597#false} assume 0bv32 != ~p7~0; {50597#false} is VALID [2018-11-23 10:54:40,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {50597#false} assume 1bv32 != ~lk7~0; {50597#false} is VALID [2018-11-23 10:54:40,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {50597#false} assume !false; {50597#false} is VALID [2018-11-23 10:54:40,943 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:40,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:40,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:40,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:40,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:40,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:40,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:40,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:40,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:40,975 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-11-23 10:54:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,888 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-11-23 10:54:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:42,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 10:54:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 10:54:42,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2018-11-23 10:54:43,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:43,332 INFO L225 Difference]: With dead ends: 3420 [2018-11-23 10:54:43,333 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 10:54:43,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 10:54:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-11-23 10:54:44,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:44,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2314 states. Second operand 2312 states. [2018-11-23 10:54:44,069 INFO L74 IsIncluded]: Start isIncluded. First operand 2314 states. Second operand 2312 states. [2018-11-23 10:54:44,069 INFO L87 Difference]: Start difference. First operand 2314 states. Second operand 2312 states. [2018-11-23 10:54:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,249 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2018-11-23 10:54:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3527 transitions. [2018-11-23 10:54:44,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,252 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2314 states. [2018-11-23 10:54:44,252 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2314 states. [2018-11-23 10:54:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,437 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2018-11-23 10:54:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3527 transitions. [2018-11-23 10:54:44,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:44,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 10:54:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-11-23 10:54:44,648 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-11-23 10:54:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:44,648 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-11-23 10:54:44,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-11-23 10:54:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:44,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:44,649 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, 1, 1, 1, 1, 1] [2018-11-23 10:54:44,650 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:44,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-11-23 10:54:44,650 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:44,650 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:54:44,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:44,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {61216#true} call ULTIMATE.init(); {61216#true} is VALID [2018-11-23 10:54:44,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {61216#true} assume true; {61216#true} is VALID [2018-11-23 10:54:44,738 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {61216#true} {61216#true} #231#return; {61216#true} is VALID [2018-11-23 10:54:44,738 INFO L256 TraceCheckUtils]: 3: Hoare triple {61216#true} call #t~ret13 := main(); {61216#true} is VALID [2018-11-23 10:54:44,738 INFO L273 TraceCheckUtils]: 4: Hoare triple {61216#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {61216#true} is VALID [2018-11-23 10:54:44,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {61216#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {61216#true} is VALID [2018-11-23 10:54:44,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {61216#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {61216#true} is VALID [2018-11-23 10:54:44,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {61216#true} assume !(0bv32 != ~p1~0); {61216#true} is VALID [2018-11-23 10:54:44,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {61216#true} assume !(0bv32 != ~p2~0); {61216#true} is VALID [2018-11-23 10:54:44,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {61216#true} assume !(0bv32 != ~p3~0); {61216#true} is VALID [2018-11-23 10:54:44,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {61216#true} assume !(0bv32 != ~p4~0); {61216#true} is VALID [2018-11-23 10:54:44,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {61216#true} assume !(0bv32 != ~p5~0); {61216#true} is VALID [2018-11-23 10:54:44,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {61216#true} assume !(0bv32 != ~p6~0); {61216#true} is VALID [2018-11-23 10:54:44,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {61216#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,754 INFO L273 TraceCheckUtils]: 22: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:44,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {61260#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {61217#false} is VALID [2018-11-23 10:54:44,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {61217#false} assume !false; {61217#false} is VALID [2018-11-23 10:54:44,756 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:44,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:44,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:44,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:44,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:44,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:44,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:44,787 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-11-23 10:54:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,057 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-11-23 10:54:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:47,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 10:54:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2018-11-23 10:54:47,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2018-11-23 10:54:47,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:47,906 INFO L225 Difference]: With dead ends: 4108 [2018-11-23 10:54:47,906 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 10:54:47,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 10:54:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-11-23 10:54:48,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:48,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 3336 states. [2018-11-23 10:54:48,519 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 3336 states. [2018-11-23 10:54:48,520 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 3336 states. [2018-11-23 10:54:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,091 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2018-11-23 10:54:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 6343 transitions. [2018-11-23 10:54:49,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,095 INFO L74 IsIncluded]: Start isIncluded. First operand 3336 states. Second operand 4106 states. [2018-11-23 10:54:49,095 INFO L87 Difference]: Start difference. First operand 3336 states. Second operand 4106 states. [2018-11-23 10:54:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,665 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2018-11-23 10:54:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 6343 transitions. [2018-11-23 10:54:49,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-23 10:54:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-11-23 10:54:50,137 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-11-23 10:54:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:50,138 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-11-23 10:54:50,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-11-23 10:54:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:50,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:50,140 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, 1, 1, 1, 1, 1] [2018-11-23 10:54:50,141 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:50,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-11-23 10:54:50,141 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:50,141 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:54:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:50,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:50,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {77164#true} call ULTIMATE.init(); {77164#true} is VALID [2018-11-23 10:54:50,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {77164#true} assume true; {77164#true} is VALID [2018-11-23 10:54:50,254 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {77164#true} {77164#true} #231#return; {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L256 TraceCheckUtils]: 3: Hoare triple {77164#true} call #t~ret13 := main(); {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {77164#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {77164#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {77164#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {77164#true} assume !(0bv32 != ~p1~0); {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {77164#true} assume !(0bv32 != ~p2~0); {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {77164#true} assume !(0bv32 != ~p3~0); {77164#true} is VALID [2018-11-23 10:54:50,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {77164#true} assume !(0bv32 != ~p4~0); {77164#true} is VALID [2018-11-23 10:54:50,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {77164#true} assume !(0bv32 != ~p5~0); {77164#true} is VALID [2018-11-23 10:54:50,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {77164#true} assume !(0bv32 != ~p6~0); {77164#true} is VALID [2018-11-23 10:54:50,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {77164#true} assume !(0bv32 != ~p7~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {77208#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:54:50,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {77208#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {77165#false} is VALID [2018-11-23 10:54:50,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {77165#false} assume 1bv32 != ~lk7~0; {77165#false} is VALID [2018-11-23 10:54:50,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {77165#false} assume !false; {77165#false} is VALID [2018-11-23 10:54:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:50,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:50,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:50,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:50,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:50,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:50,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:50,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:50,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:50,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:50,293 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-11-23 10:54:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,058 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-11-23 10:54:54,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:54,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 10:54:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2018-11-23 10:54:54,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2018-11-23 10:54:54,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:55,217 INFO L225 Difference]: With dead ends: 7756 [2018-11-23 10:54:55,218 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 10:54:55,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 10:54:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-11-23 10:54:56,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:56,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4490 states. Second operand 4488 states. [2018-11-23 10:54:56,937 INFO L74 IsIncluded]: Start isIncluded. First operand 4490 states. Second operand 4488 states. [2018-11-23 10:54:56,937 INFO L87 Difference]: Start difference. First operand 4490 states. Second operand 4488 states. [2018-11-23 10:54:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,674 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2018-11-23 10:54:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6599 transitions. [2018-11-23 10:54:57,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:57,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:57,679 INFO L74 IsIncluded]: Start isIncluded. First operand 4488 states. Second operand 4490 states. [2018-11-23 10:54:57,679 INFO L87 Difference]: Start difference. First operand 4488 states. Second operand 4490 states. [2018-11-23 10:54:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:58,353 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2018-11-23 10:54:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6599 transitions. [2018-11-23 10:54:58,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:58,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:58,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:58,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-11-23 10:54:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-11-23 10:54:59,199 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-11-23 10:54:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:59,200 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-11-23 10:54:59,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-11-23 10:54:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:59,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:59,203 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, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:59,203 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:59,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-11-23 10:54:59,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:59,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:54:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:59,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:59,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {98808#true} call ULTIMATE.init(); {98808#true} is VALID [2018-11-23 10:54:59,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {98808#true} assume true; {98808#true} is VALID [2018-11-23 10:54:59,308 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {98808#true} {98808#true} #231#return; {98808#true} is VALID [2018-11-23 10:54:59,308 INFO L256 TraceCheckUtils]: 3: Hoare triple {98808#true} call #t~ret13 := main(); {98808#true} is VALID [2018-11-23 10:54:59,309 INFO L273 TraceCheckUtils]: 4: Hoare triple {98808#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {98808#true} is VALID [2018-11-23 10:54:59,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {98808#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {98808#true} is VALID [2018-11-23 10:54:59,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {98808#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {98808#true} is VALID [2018-11-23 10:54:59,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {98808#true} assume !(0bv32 != ~p1~0); {98808#true} is VALID [2018-11-23 10:54:59,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {98808#true} assume !(0bv32 != ~p2~0); {98808#true} is VALID [2018-11-23 10:54:59,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {98808#true} assume !(0bv32 != ~p3~0); {98808#true} is VALID [2018-11-23 10:54:59,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {98808#true} assume !(0bv32 != ~p4~0); {98808#true} is VALID [2018-11-23 10:54:59,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {98808#true} assume !(0bv32 != ~p5~0); {98808#true} is VALID [2018-11-23 10:54:59,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {98808#true} assume !(0bv32 != ~p6~0); {98808#true} is VALID [2018-11-23 10:54:59,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {98808#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {98852#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:54:59,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {98852#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {98809#false} is VALID [2018-11-23 10:54:59,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {98809#false} assume 0bv32 != ~p8~0; {98809#false} is VALID [2018-11-23 10:54:59,329 INFO L273 TraceCheckUtils]: 27: Hoare triple {98809#false} assume 1bv32 != ~lk8~0; {98809#false} is VALID [2018-11-23 10:54:59,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {98809#false} assume !false; {98809#false} is VALID [2018-11-23 10:54:59,330 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,331 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:59,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:59,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:59,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:59,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:59,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:59,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:59,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:59,358 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-11-23 10:55:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:02,994 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-11-23 10:55:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:02,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 10:55:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2018-11-23 10:55:02,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2018-11-23 10:55:03,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:04,089 INFO L225 Difference]: With dead ends: 6732 [2018-11-23 10:55:04,090 INFO L226 Difference]: Without dead ends: 4554 [2018-11-23 10:55:04,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-23 10:55:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-11-23 10:55:05,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:05,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4554 states. Second operand 4552 states. [2018-11-23 10:55:05,287 INFO L74 IsIncluded]: Start isIncluded. First operand 4554 states. Second operand 4552 states. [2018-11-23 10:55:05,287 INFO L87 Difference]: Start difference. First operand 4554 states. Second operand 4552 states. [2018-11-23 10:55:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:05,911 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2018-11-23 10:55:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6599 transitions. [2018-11-23 10:55:05,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:05,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:05,915 INFO L74 IsIncluded]: Start isIncluded. First operand 4552 states. Second operand 4554 states. [2018-11-23 10:55:05,915 INFO L87 Difference]: Start difference. First operand 4552 states. Second operand 4554 states. [2018-11-23 10:55:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,701 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2018-11-23 10:55:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6599 transitions. [2018-11-23 10:55:06,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:06,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:06,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:06,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-11-23 10:55:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-11-23 10:55:07,585 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-11-23 10:55:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:07,585 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-11-23 10:55:07,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-11-23 10:55:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:55:07,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:07,588 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, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:07,588 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:07,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-11-23 10:55:07,588 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:07,588 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:07,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:07,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:07,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {119623#true} call ULTIMATE.init(); {119623#true} is VALID [2018-11-23 10:55:07,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {119623#true} assume true; {119623#true} is VALID [2018-11-23 10:55:07,697 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {119623#true} {119623#true} #231#return; {119623#true} is VALID [2018-11-23 10:55:07,698 INFO L256 TraceCheckUtils]: 3: Hoare triple {119623#true} call #t~ret13 := main(); {119623#true} is VALID [2018-11-23 10:55:07,698 INFO L273 TraceCheckUtils]: 4: Hoare triple {119623#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {119623#true} is VALID [2018-11-23 10:55:07,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {119623#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {119623#true} is VALID [2018-11-23 10:55:07,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {119623#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {119623#true} is VALID [2018-11-23 10:55:07,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {119623#true} assume !(0bv32 != ~p1~0); {119623#true} is VALID [2018-11-23 10:55:07,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {119623#true} assume !(0bv32 != ~p2~0); {119623#true} is VALID [2018-11-23 10:55:07,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {119623#true} assume !(0bv32 != ~p3~0); {119623#true} is VALID [2018-11-23 10:55:07,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {119623#true} assume !(0bv32 != ~p4~0); {119623#true} is VALID [2018-11-23 10:55:07,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {119623#true} assume !(0bv32 != ~p5~0); {119623#true} is VALID [2018-11-23 10:55:07,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {119623#true} assume !(0bv32 != ~p6~0); {119623#true} is VALID [2018-11-23 10:55:07,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {119623#true} assume !(0bv32 != ~p7~0); {119623#true} is VALID [2018-11-23 10:55:07,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {119623#true} assume !(0bv32 != ~p8~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,702 INFO L273 TraceCheckUtils]: 21: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {119670#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:07,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {119670#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {119624#false} is VALID [2018-11-23 10:55:07,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {119624#false} assume 1bv32 != ~lk8~0; {119624#false} is VALID [2018-11-23 10:55:07,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {119624#false} assume !false; {119624#false} is VALID [2018-11-23 10:55:07,705 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:07,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:07,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:07,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:07,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:07,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:07,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:07,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:07,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:07,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:07,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:07,736 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-11-23 10:55:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:19,323 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-11-23 10:55:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:19,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 10:55:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2018-11-23 10:55:19,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2018-11-23 10:55:19,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:22,859 INFO L225 Difference]: With dead ends: 13260 [2018-11-23 10:55:22,859 INFO L226 Difference]: Without dead ends: 8842 [2018-11-23 10:55:22,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-11-23 10:55:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-11-23 10:55:25,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:25,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8842 states. Second operand 8840 states. [2018-11-23 10:55:25,938 INFO L74 IsIncluded]: Start isIncluded. First operand 8842 states. Second operand 8840 states. [2018-11-23 10:55:25,938 INFO L87 Difference]: Start difference. First operand 8842 states. Second operand 8840 states. [2018-11-23 10:55:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:28,912 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2018-11-23 10:55:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 12423 transitions. [2018-11-23 10:55:28,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:28,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:28,919 INFO L74 IsIncluded]: Start isIncluded. First operand 8840 states. Second operand 8842 states. [2018-11-23 10:55:28,919 INFO L87 Difference]: Start difference. First operand 8840 states. Second operand 8842 states. [2018-11-23 10:55:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:31,942 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2018-11-23 10:55:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 12423 transitions. [2018-11-23 10:55:31,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:31,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:31,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:31,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-23 10:55:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-11-23 10:55:35,323 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-11-23 10:55:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:35,323 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-11-23 10:55:35,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-11-23 10:55:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:55:35,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:35,327 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, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:35,327 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:35,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-11-23 10:55:35,328 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:35,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:55:35,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:35,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:35,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {160150#true} call ULTIMATE.init(); {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {160150#true} assume true; {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {160150#true} {160150#true} #231#return; {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L256 TraceCheckUtils]: 3: Hoare triple {160150#true} call #t~ret13 := main(); {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L273 TraceCheckUtils]: 4: Hoare triple {160150#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {160150#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {160150#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {160150#true} assume !(0bv32 != ~p1~0); {160150#true} is VALID [2018-11-23 10:55:35,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {160150#true} assume !(0bv32 != ~p2~0); {160150#true} is VALID [2018-11-23 10:55:35,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {160150#true} assume !(0bv32 != ~p3~0); {160150#true} is VALID [2018-11-23 10:55:35,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {160150#true} assume !(0bv32 != ~p4~0); {160150#true} is VALID [2018-11-23 10:55:35,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {160150#true} assume !(0bv32 != ~p5~0); {160150#true} is VALID [2018-11-23 10:55:35,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {160150#true} assume !(0bv32 != ~p6~0); {160150#true} is VALID [2018-11-23 10:55:35,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {160150#true} assume !(0bv32 != ~p7~0); {160150#true} is VALID [2018-11-23 10:55:35,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {160150#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,455 INFO L273 TraceCheckUtils]: 20: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,456 INFO L273 TraceCheckUtils]: 22: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,457 INFO L273 TraceCheckUtils]: 25: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:35,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {160197#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {160151#false} is VALID [2018-11-23 10:55:35,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {160151#false} assume !false; {160151#false} is VALID [2018-11-23 10:55:35,459 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:35,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:35,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:35,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:35,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:35,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:35,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:35,493 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-11-23 10:55:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:44,862 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-11-23 10:55:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:44,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:55:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 10:55:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 10:55:44,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2018-11-23 10:55:45,004 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:55:49,256 INFO L225 Difference]: With dead ends: 10124 [2018-11-23 10:55:49,257 INFO L226 Difference]: Without dead ends: 10122 [2018-11-23 10:55:49,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-11-23 10:55:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-11-23 10:55:54,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:54,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10122 states. Second operand 8840 states. [2018-11-23 10:55:54,408 INFO L74 IsIncluded]: Start isIncluded. First operand 10122 states. Second operand 8840 states. [2018-11-23 10:55:54,408 INFO L87 Difference]: Start difference. First operand 10122 states. Second operand 8840 states. [2018-11-23 10:55:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:58,289 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2018-11-23 10:55:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 10122 states and 14599 transitions. [2018-11-23 10:55:58,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:58,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:58,297 INFO L74 IsIncluded]: Start isIncluded. First operand 8840 states. Second operand 10122 states. [2018-11-23 10:55:58,297 INFO L87 Difference]: Start difference. First operand 8840 states. Second operand 10122 states. [2018-11-23 10:56:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:02,281 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2018-11-23 10:56:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10122 states and 14599 transitions. [2018-11-23 10:56:02,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:02,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:02,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:02,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-23 10:56:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-11-23 10:56:05,249 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-11-23 10:56:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:05,249 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-11-23 10:56:05,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-11-23 10:56:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:56:05,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:05,255 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:56:05,255 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:05,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-11-23 10:56:05,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:05,258 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:56:05,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:05,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:05,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {200101#true} call ULTIMATE.init(); {200101#true} is VALID [2018-11-23 10:56:05,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {200101#true} assume true; {200101#true} is VALID [2018-11-23 10:56:05,366 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {200101#true} {200101#true} #231#return; {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L256 TraceCheckUtils]: 3: Hoare triple {200101#true} call #t~ret13 := main(); {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L273 TraceCheckUtils]: 4: Hoare triple {200101#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {200101#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {200101#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {200101#true} assume !(0bv32 != ~p1~0); {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {200101#true} assume !(0bv32 != ~p2~0); {200101#true} is VALID [2018-11-23 10:56:05,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {200101#true} assume !(0bv32 != ~p3~0); {200101#true} is VALID [2018-11-23 10:56:05,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {200101#true} assume !(0bv32 != ~p4~0); {200101#true} is VALID [2018-11-23 10:56:05,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {200101#true} assume !(0bv32 != ~p5~0); {200101#true} is VALID [2018-11-23 10:56:05,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {200101#true} assume !(0bv32 != ~p6~0); {200101#true} is VALID [2018-11-23 10:56:05,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {200101#true} assume !(0bv32 != ~p7~0); {200101#true} is VALID [2018-11-23 10:56:05,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {200101#true} assume !(0bv32 != ~p8~0); {200101#true} is VALID [2018-11-23 10:56:05,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {200101#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,373 INFO L273 TraceCheckUtils]: 27: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:05,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {200151#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {200102#false} is VALID [2018-11-23 10:56:05,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {200102#false} assume !false; {200102#false} is VALID [2018-11-23 10:56:05,376 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:56:05,376 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:05,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:05,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:05,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:56:05,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:05,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:05,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:05,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:05,407 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-11-23 10:56:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:23,524 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-11-23 10:56:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:23,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:56:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:56:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 10:56:23,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 10:56:23,669 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:56:33,988 INFO L225 Difference]: With dead ends: 15244 [2018-11-23 10:56:33,989 INFO L226 Difference]: Without dead ends: 15242 [2018-11-23 10:56:33,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-11-23 10:56:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-11-23 10:56:37,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:37,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15242 states. Second operand 13192 states. [2018-11-23 10:56:37,379 INFO L74 IsIncluded]: Start isIncluded. First operand 15242 states. Second operand 13192 states. [2018-11-23 10:56:37,380 INFO L87 Difference]: Start difference. First operand 15242 states. Second operand 13192 states. [2018-11-23 10:56:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:46,898 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2018-11-23 10:56:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 21383 transitions. [2018-11-23 10:56:46,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:46,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:46,908 INFO L74 IsIncluded]: Start isIncluded. First operand 13192 states. Second operand 15242 states. [2018-11-23 10:56:46,908 INFO L87 Difference]: Start difference. First operand 13192 states. Second operand 15242 states. [2018-11-23 10:56:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:56,547 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2018-11-23 10:56:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 21383 transitions. [2018-11-23 10:56:56,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:56,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:56,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:56,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-11-23 10:57:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-11-23 10:57:04,814 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-11-23 10:57:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:57:04,814 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-11-23 10:57:04,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:57:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-11-23 10:57:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:57:04,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:57:04,821 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:57:04,821 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:57:04,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:57:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-11-23 10:57:04,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:57:04,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:57:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:57:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:57:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:57:04,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:57:04,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {259895#true} call ULTIMATE.init(); {259895#true} is VALID [2018-11-23 10:57:04,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {259895#true} assume true; {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {259895#true} {259895#true} #231#return; {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {259895#true} call #t~ret13 := main(); {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L273 TraceCheckUtils]: 4: Hoare triple {259895#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;havoc ~cond~0; {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {259895#true} assume !false;~cond~0 := #t~nondet12;havoc #t~nondet12; {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {259895#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;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32; {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {259895#true} assume !(0bv32 != ~p1~0); {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {259895#true} assume !(0bv32 != ~p2~0); {259895#true} is VALID [2018-11-23 10:57:04,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {259895#true} assume !(0bv32 != ~p3~0); {259895#true} is VALID [2018-11-23 10:57:04,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {259895#true} assume !(0bv32 != ~p4~0); {259895#true} is VALID [2018-11-23 10:57:04,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {259895#true} assume !(0bv32 != ~p5~0); {259895#true} is VALID [2018-11-23 10:57:04,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {259895#true} assume !(0bv32 != ~p6~0); {259895#true} is VALID [2018-11-23 10:57:04,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {259895#true} assume !(0bv32 != ~p7~0); {259895#true} is VALID [2018-11-23 10:57:04,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {259895#true} assume !(0bv32 != ~p8~0); {259895#true} is VALID [2018-11-23 10:57:04,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {259895#true} assume !(0bv32 != ~p9~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {259945#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:04,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {259945#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {259896#false} is VALID [2018-11-23 10:57:04,929 INFO L273 TraceCheckUtils]: 28: Hoare triple {259896#false} assume 1bv32 != ~lk9~0; {259896#false} is VALID [2018-11-23 10:57:04,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {259896#false} assume !false; {259896#false} is VALID [2018-11-23 10:57:04,931 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:57:04,931 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:57:04,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:57:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:57:04,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:57:04,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:57:04,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:57:04,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:57:04,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:57:04,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:57:04,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:57:04,961 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states.