java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:43:27,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:43:27,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:43:27,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:43:27,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:43:27,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:43:27,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:43:27,811 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:43:27,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:43:27,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:43:27,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:43:27,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:43:27,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:43:27,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:43:27,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:43:27,826 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:43:27,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:43:27,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:43:27,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:43:27,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:43:27,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:43:27,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:43:27,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:43:27,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:43:27,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:43:27,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:43:27,842 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:43:27,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:43:27,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:43:27,844 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:43:27,845 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:43:27,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:43:27,846 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:43:27,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:43:27,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:43:27,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:43:27,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:43:27,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:43:27,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:43:27,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:43:27,866 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:43:27,867 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:43:27,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:43:27,867 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:43:27,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:43:27,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:43:27,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:43:27,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:43:27,869 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:43:27,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:43:27,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:43:27,869 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:43:27,869 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:43:27,870 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:43:27,870 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:43:27,870 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:43:27,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:43:27,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:43:27,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:43:27,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:43:27,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:43:27,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:43:27,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:43:27,872 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:43:27,872 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:43:27,872 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:43:27,872 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:43:27,873 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:43:27,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:43:27,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:43:27,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:43:27,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:43:27,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:43:27,948 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:43:27,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 16:43:28,010 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c579745da/203dec196ecb4ac5a95a8e6fe4d392d1/FLAGb385f52ee [2018-11-14 16:43:28,572 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:43:28,576 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 16:43:28,595 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c579745da/203dec196ecb4ac5a95a8e6fe4d392d1/FLAGb385f52ee [2018-11-14 16:43:28,613 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c579745da/203dec196ecb4ac5a95a8e6fe4d392d1 [2018-11-14 16:43:28,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:43:28,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:43:28,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:43:28,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:43:28,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:43:28,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:43:28" (1/1) ... [2018-11-14 16:43:28,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e00be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:28, skipping insertion in model container [2018-11-14 16:43:28,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:43:28" (1/1) ... [2018-11-14 16:43:28,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:43:28,732 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:43:29,189 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:43:29,200 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:43:29,329 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:43:29,349 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:43:29,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29 WrapperNode [2018-11-14 16:43:29,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:43:29,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:43:29,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:43:29,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:43:29,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... [2018-11-14 16:43:29,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:43:29,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:43:29,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:43:29,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:43:29,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:43:29,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:43:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:43:29,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:43:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:43:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:43:29,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:43:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:43:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:43:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:43:29,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:43:32,030 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:43:32,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:43:32 BoogieIcfgContainer [2018-11-14 16:43:32,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:43:32,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:43:32,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:43:32,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:43:32,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:43:28" (1/3) ... [2018-11-14 16:43:32,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54151e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:43:32, skipping insertion in model container [2018-11-14 16:43:32,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:29" (2/3) ... [2018-11-14 16:43:32,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54151e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:43:32, skipping insertion in model container [2018-11-14 16:43:32,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:43:32" (3/3) ... [2018-11-14 16:43:32,044 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 16:43:32,055 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:43:32,064 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-14 16:43:32,080 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-14 16:43:32,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:43:32,119 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:43:32,120 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:43:32,120 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:43:32,120 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:43:32,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:43:32,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:43:32,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:43:32,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:43:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-14 16:43:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:43:32,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:32,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:32,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:32,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-14 16:43:32,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:32,181 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:32,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:32,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:32,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {128#true} is VALID [2018-11-14 16:43:32,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {128#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {128#true} is VALID [2018-11-14 16:43:32,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2018-11-14 16:43:32,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #388#return; {128#true} is VALID [2018-11-14 16:43:32,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret15 := main(); {128#true} is VALID [2018-11-14 16:43:32,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {128#true} is VALID [2018-11-14 16:43:32,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {128#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:32,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {151#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:32,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {151#(= (_ bv0 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {158#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:32,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {158#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {129#false} is VALID [2018-11-14 16:43:32,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2018-11-14 16:43:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:32,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:32,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:32,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:43:32,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 16:43:32,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:32,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:43:32,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:32,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:43:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:43:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:43:32,578 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-14 16:43:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:34,117 INFO L93 Difference]: Finished difference Result 141 states and 219 transitions. [2018-11-14 16:43:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:43:34,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-14 16:43:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-14 16:43:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:43:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-14 16:43:34,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2018-11-14 16:43:34,517 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-14 16:43:34,538 INFO L225 Difference]: With dead ends: 141 [2018-11-14 16:43:34,539 INFO L226 Difference]: Without dead ends: 125 [2018-11-14 16:43:34,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-14 16:43:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-11-14 16:43:34,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:34,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 122 states. [2018-11-14 16:43:34,599 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 122 states. [2018-11-14 16:43:34,600 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 122 states. [2018-11-14 16:43:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:34,612 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-14 16:43:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-14 16:43:34,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:34,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:34,614 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 125 states. [2018-11-14 16:43:34,615 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 125 states. [2018-11-14 16:43:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:34,626 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-14 16:43:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-14 16:43:34,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:34,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:34,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:34,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:43:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2018-11-14 16:43:34,638 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 11 [2018-11-14 16:43:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:34,639 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2018-11-14 16:43:34,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:43:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2018-11-14 16:43:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:43:34,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:34,640 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:34,641 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:34,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-14 16:43:34,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:34,642 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:34,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:34,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:34,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {699#true} is VALID [2018-11-14 16:43:34,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {699#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {699#true} is VALID [2018-11-14 16:43:34,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {699#true} assume true; {699#true} is VALID [2018-11-14 16:43:34,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {699#true} {699#true} #388#return; {699#true} is VALID [2018-11-14 16:43:34,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {699#true} call #t~ret15 := main(); {699#true} is VALID [2018-11-14 16:43:34,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {699#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {699#true} is VALID [2018-11-14 16:43:34,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {699#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:34,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {722#(= (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:43:34,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:43:34,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {726#(and (= (_ bv0 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {733#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:34,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {700#false} is VALID [2018-11-14 16:43:34,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {700#false} assume !false; {700#false} is VALID [2018-11-14 16:43:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:34,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:43:34,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:34,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:34,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 16:43:34,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:34,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:34,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:34,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:34,862 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand 5 states. [2018-11-14 16:43:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:36,107 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-14 16:43:36,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:36,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 16:43:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2018-11-14 16:43:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2018-11-14 16:43:36,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 145 transitions. [2018-11-14 16:43:36,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:36,406 INFO L225 Difference]: With dead ends: 125 [2018-11-14 16:43:36,406 INFO L226 Difference]: Without dead ends: 120 [2018-11-14 16:43:36,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-14 16:43:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-14 16:43:36,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:36,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 120 states. [2018-11-14 16:43:36,463 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-14 16:43:36,463 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-14 16:43:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:36,469 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-14 16:43:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-14 16:43:36,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:36,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:36,472 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 120 states. [2018-11-14 16:43:36,472 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 120 states. [2018-11-14 16:43:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:36,478 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-11-14 16:43:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-14 16:43:36,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:36,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:36,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:36,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-14 16:43:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-11-14 16:43:36,486 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 12 [2018-11-14 16:43:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:36,487 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-11-14 16:43:36,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-14 16:43:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:43:36,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:36,488 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:36,489 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:36,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 489213650, now seen corresponding path program 1 times [2018-11-14 16:43:36,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:36,490 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:36,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:36,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2018-11-14 16:43:36,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {1243#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {1243#true} is VALID [2018-11-14 16:43:36,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2018-11-14 16:43:36,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #388#return; {1243#true} is VALID [2018-11-14 16:43:36,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret15 := main(); {1243#true} is VALID [2018-11-14 16:43:36,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1243#true} is VALID [2018-11-14 16:43:36,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {1243#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:36,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:36,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:36,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {1266#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:36,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {1266#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {1279#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:36,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {1279#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {1279#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:36,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:36,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {1286#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {1244#false} is VALID [2018-11-14 16:43:36,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2018-11-14 16:43:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:36,628 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:36,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:36,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:36,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:36,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:36,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:36,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:36,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:36,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:36,667 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 5 states. [2018-11-14 16:43:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:37,900 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2018-11-14 16:43:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:37,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2018-11-14 16:43:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2018-11-14 16:43:37,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 178 transitions. [2018-11-14 16:43:38,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:38,287 INFO L225 Difference]: With dead ends: 157 [2018-11-14 16:43:38,288 INFO L226 Difference]: Without dead ends: 155 [2018-11-14 16:43:38,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-14 16:43:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2018-11-14 16:43:38,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:38,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 122 states. [2018-11-14 16:43:38,311 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 122 states. [2018-11-14 16:43:38,311 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 122 states. [2018-11-14 16:43:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:38,318 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-14 16:43:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-11-14 16:43:38,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:38,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:38,320 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 155 states. [2018-11-14 16:43:38,320 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 155 states. [2018-11-14 16:43:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:38,327 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-14 16:43:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2018-11-14 16:43:38,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:38,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:38,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:38,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:43:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-11-14 16:43:38,334 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 15 [2018-11-14 16:43:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:38,334 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-11-14 16:43:38,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-11-14 16:43:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:43:38,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:38,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:38,336 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:38,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-14 16:43:38,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:38,337 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:38,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:38,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:38,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {1903#true} call ULTIMATE.init(); {1903#true} is VALID [2018-11-14 16:43:38,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {1903#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {1903#true} is VALID [2018-11-14 16:43:38,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {1903#true} assume true; {1903#true} is VALID [2018-11-14 16:43:38,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1903#true} {1903#true} #388#return; {1903#true} is VALID [2018-11-14 16:43:38,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {1903#true} call #t~ret15 := main(); {1903#true} is VALID [2018-11-14 16:43:38,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {1903#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1903#true} is VALID [2018-11-14 16:43:38,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {1903#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:38,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:38,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:38,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1926#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:38,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {1926#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {1939#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:38,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {1939#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1939#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:38,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {1939#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1946#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:38,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {1946#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {1904#false} is VALID [2018-11-14 16:43:38,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#false} assume !false; {1904#false} is VALID [2018-11-14 16:43:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:38,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:38,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:38,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:38,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:38,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:38,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:38,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:38,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:38,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:38,609 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 5 states. [2018-11-14 16:43:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:40,194 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2018-11-14 16:43:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:40,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:43:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-14 16:43:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-14 16:43:40,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 176 transitions. [2018-11-14 16:43:40,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:40,577 INFO L225 Difference]: With dead ends: 155 [2018-11-14 16:43:40,577 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 16:43:40,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 16:43:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 125. [2018-11-14 16:43:40,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:40,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 125 states. [2018-11-14 16:43:40,603 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 125 states. [2018-11-14 16:43:40,603 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 125 states. [2018-11-14 16:43:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:40,607 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-14 16:43:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-14 16:43:40,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:40,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:40,608 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 153 states. [2018-11-14 16:43:40,608 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 153 states. [2018-11-14 16:43:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:40,613 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-14 16:43:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-14 16:43:40,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:40,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:40,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:40,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 16:43:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-14 16:43:40,618 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 15 [2018-11-14 16:43:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:40,619 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-14 16:43:40,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-14 16:43:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:43:40,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:40,620 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:40,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:40,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2014242973, now seen corresponding path program 1 times [2018-11-14 16:43:40,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:40,621 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:40,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:40,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:40,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2561#true} is VALID [2018-11-14 16:43:40,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {2561#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {2561#true} is VALID [2018-11-14 16:43:40,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2018-11-14 16:43:40,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #388#return; {2561#true} is VALID [2018-11-14 16:43:40,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret15 := main(); {2561#true} is VALID [2018-11-14 16:43:40,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {2561#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2561#true} is VALID [2018-11-14 16:43:40,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {2561#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:40,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:40,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:40,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {2584#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:40,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {2584#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {2597#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:40,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {2597#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:40,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:40,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {2601#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2608#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:40,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {2608#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {2562#false} is VALID [2018-11-14 16:43:40,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2018-11-14 16:43:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:40,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:40,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:40,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:40,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:43:40,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:40,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:40,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:40,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:40,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:40,853 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 6 states. [2018-11-14 16:43:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:42,356 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-14 16:43:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:42,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:43:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2018-11-14 16:43:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2018-11-14 16:43:42,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 174 transitions. [2018-11-14 16:43:42,607 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-14 16:43:42,611 INFO L225 Difference]: With dead ends: 153 [2018-11-14 16:43:42,611 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 16:43:42,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 16:43:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 123. [2018-11-14 16:43:42,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:42,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 123 states. [2018-11-14 16:43:42,634 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 123 states. [2018-11-14 16:43:42,634 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 123 states. [2018-11-14 16:43:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:42,639 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-14 16:43:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-11-14 16:43:42,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:42,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:42,640 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 148 states. [2018-11-14 16:43:42,641 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 148 states. [2018-11-14 16:43:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:42,645 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-14 16:43:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-11-14 16:43:42,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:42,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:42,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:42,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 16:43:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-11-14 16:43:42,650 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 16 [2018-11-14 16:43:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:42,651 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-11-14 16:43:42,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-14 16:43:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:43:42,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:42,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:42,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:42,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-14 16:43:42,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:42,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:42,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {3208#true} call ULTIMATE.init(); {3208#true} is VALID [2018-11-14 16:43:42,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {3208#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {3208#true} is VALID [2018-11-14 16:43:42,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {3208#true} assume true; {3208#true} is VALID [2018-11-14 16:43:42,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3208#true} {3208#true} #388#return; {3208#true} is VALID [2018-11-14 16:43:42,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {3208#true} call #t~ret15 := main(); {3208#true} is VALID [2018-11-14 16:43:42,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {3208#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3208#true} is VALID [2018-11-14 16:43:42,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {3208#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:42,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:42,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:42,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3231#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:42,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {3231#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3244#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:42,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {3244#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3244#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:42,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {3244#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3251#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:42,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {3251#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3255#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:42,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {3255#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {3209#false} is VALID [2018-11-14 16:43:42,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {3209#false} assume !false; {3209#false} is VALID [2018-11-14 16:43:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:42,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:42,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:42,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:42,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:43:42,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:42,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:42,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:42,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:42,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:42,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:42,842 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 6 states. [2018-11-14 16:43:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:44,414 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2018-11-14 16:43:44,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:44,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 16:43:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2018-11-14 16:43:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2018-11-14 16:43:44,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 169 transitions. [2018-11-14 16:43:44,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:44,871 INFO L225 Difference]: With dead ends: 148 [2018-11-14 16:43:44,871 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 16:43:44,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 16:43:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2018-11-14 16:43:44,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:44,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 122 states. [2018-11-14 16:43:44,884 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 122 states. [2018-11-14 16:43:44,884 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 122 states. [2018-11-14 16:43:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:44,889 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-11-14 16:43:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-11-14 16:43:44,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:44,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:44,890 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 144 states. [2018-11-14 16:43:44,890 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 144 states. [2018-11-14 16:43:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:44,895 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-11-14 16:43:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-11-14 16:43:44,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:44,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:44,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:44,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:43:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2018-11-14 16:43:44,900 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 16 [2018-11-14 16:43:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:44,900 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2018-11-14 16:43:44,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2018-11-14 16:43:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:43:44,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:44,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:44,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:44,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-14 16:43:44,902 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:44,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:45,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:45,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2018-11-14 16:43:45,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {3840#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {3840#true} is VALID [2018-11-14 16:43:45,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2018-11-14 16:43:45,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #388#return; {3840#true} is VALID [2018-11-14 16:43:45,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret15 := main(); {3840#true} is VALID [2018-11-14 16:43:45,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {3840#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3840#true} is VALID [2018-11-14 16:43:45,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {3840#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3863#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {3863#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {3876#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:45,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3889#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:45,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {3889#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~6 == 0bv32; {3841#false} is VALID [2018-11-14 16:43:45,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2018-11-14 16:43:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:45,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:45,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:45,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:45,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:43:45,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:45,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:45,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:45,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:45,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:45,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:45,318 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 5 states. [2018-11-14 16:43:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:46,582 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-11-14 16:43:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:46,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:43:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-14 16:43:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-14 16:43:46,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2018-11-14 16:43:46,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:46,820 INFO L225 Difference]: With dead ends: 175 [2018-11-14 16:43:46,820 INFO L226 Difference]: Without dead ends: 173 [2018-11-14 16:43:46,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-14 16:43:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 125. [2018-11-14 16:43:46,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:46,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 125 states. [2018-11-14 16:43:46,836 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 125 states. [2018-11-14 16:43:46,836 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 125 states. [2018-11-14 16:43:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:46,842 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-14 16:43:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2018-11-14 16:43:46,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:46,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:46,843 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 173 states. [2018-11-14 16:43:46,843 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 173 states. [2018-11-14 16:43:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:46,849 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-14 16:43:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2018-11-14 16:43:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:46,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:46,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:46,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 16:43:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2018-11-14 16:43:46,854 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 17 [2018-11-14 16:43:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:46,854 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2018-11-14 16:43:46,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2018-11-14 16:43:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:43:46,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:46,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:46,855 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:46,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-14 16:43:46,856 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:46,856 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:46,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:46,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:46,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {4564#true} call ULTIMATE.init(); {4564#true} is VALID [2018-11-14 16:43:46,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {4564#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {4564#true} is VALID [2018-11-14 16:43:46,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {4564#true} assume true; {4564#true} is VALID [2018-11-14 16:43:46,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4564#true} {4564#true} #388#return; {4564#true} is VALID [2018-11-14 16:43:46,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {4564#true} call #t~ret15 := main(); {4564#true} is VALID [2018-11-14 16:43:46,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {4564#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4564#true} is VALID [2018-11-14 16:43:46,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {4564#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:46,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4587#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {4587#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {4600#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:47,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {4600#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4613#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:47,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {4613#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {4565#false} is VALID [2018-11-14 16:43:47,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {4565#false} assume !false; {4565#false} is VALID [2018-11-14 16:43:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:47,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:47,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:47,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:47,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:43:47,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:47,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:47,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:47,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:47,073 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 5 states. [2018-11-14 16:43:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:49,052 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-11-14 16:43:49,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:43:49,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 16:43:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2018-11-14 16:43:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2018-11-14 16:43:49,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 163 transitions. [2018-11-14 16:43:49,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:49,312 INFO L225 Difference]: With dead ends: 142 [2018-11-14 16:43:49,313 INFO L226 Difference]: Without dead ends: 140 [2018-11-14 16:43:49,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-14 16:43:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2018-11-14 16:43:49,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:49,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 127 states. [2018-11-14 16:43:49,328 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 127 states. [2018-11-14 16:43:49,328 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 127 states. [2018-11-14 16:43:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:49,333 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-11-14 16:43:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-11-14 16:43:49,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:49,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:49,335 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 140 states. [2018-11-14 16:43:49,335 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 140 states. [2018-11-14 16:43:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:49,340 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-11-14 16:43:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-11-14 16:43:49,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:49,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:49,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:49,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-14 16:43:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2018-11-14 16:43:49,345 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 17 [2018-11-14 16:43:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:49,346 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2018-11-14 16:43:49,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2018-11-14 16:43:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:43:49,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:49,347 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:49,347 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:49,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-14 16:43:49,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:49,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:49,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:49,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:49,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {5189#true} call ULTIMATE.init(); {5189#true} is VALID [2018-11-14 16:43:49,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {5189#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {5189#true} is VALID [2018-11-14 16:43:49,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {5189#true} assume true; {5189#true} is VALID [2018-11-14 16:43:49,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5189#true} {5189#true} #388#return; {5189#true} is VALID [2018-11-14 16:43:49,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {5189#true} call #t~ret15 := main(); {5189#true} is VALID [2018-11-14 16:43:49,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {5189#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5189#true} is VALID [2018-11-14 16:43:49,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {5189#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:49,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {5212#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:43:49,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:43:50,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {5216#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5223#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-14 16:43:50,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {5223#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:50,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:50,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:50,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:50,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:50,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {5227#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5243#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:50,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {5243#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {5190#false} is VALID [2018-11-14 16:43:50,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {5190#false} assume !false; {5190#false} is VALID [2018-11-14 16:43:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:50,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:50,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:43:50,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:43:50,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:50,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:43:50,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:50,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:43:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:43:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:50,206 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand 7 states. [2018-11-14 16:43:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:52,184 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-11-14 16:43:52,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:43:52,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:43:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-14 16:43:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-14 16:43:52,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2018-11-14 16:43:52,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:52,417 INFO L225 Difference]: With dead ends: 174 [2018-11-14 16:43:52,417 INFO L226 Difference]: Without dead ends: 172 [2018-11-14 16:43:52,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-14 16:43:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2018-11-14 16:43:52,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:52,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 128 states. [2018-11-14 16:43:52,430 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 128 states. [2018-11-14 16:43:52,430 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 128 states. [2018-11-14 16:43:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:52,434 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-11-14 16:43:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-14 16:43:52,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:52,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:52,435 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 172 states. [2018-11-14 16:43:52,435 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 172 states. [2018-11-14 16:43:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:52,439 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-11-14 16:43:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-11-14 16:43:52,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:52,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:52,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:52,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-14 16:43:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2018-11-14 16:43:52,442 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2018-11-14 16:43:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:52,443 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2018-11-14 16:43:52,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:43:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2018-11-14 16:43:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:43:52,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:52,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:52,444 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:52,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-14 16:43:52,445 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:52,445 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:52,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:52,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:52,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {5918#true} call ULTIMATE.init(); {5918#true} is VALID [2018-11-14 16:43:52,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {5918#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {5918#true} is VALID [2018-11-14 16:43:52,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {5918#true} assume true; {5918#true} is VALID [2018-11-14 16:43:52,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5918#true} {5918#true} #388#return; {5918#true} is VALID [2018-11-14 16:43:52,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {5918#true} call #t~ret15 := main(); {5918#true} is VALID [2018-11-14 16:43:52,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {5918#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5918#true} is VALID [2018-11-14 16:43:52,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {5918#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {5941#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0bv32); {5954#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:52,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {5954#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5970#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:52,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {5970#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {5919#false} is VALID [2018-11-14 16:43:52,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {5919#false} assume !false; {5919#false} is VALID [2018-11-14 16:43:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:52,600 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:52,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:52,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:52,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 16:43:52,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:52,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:52,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:52,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:52,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:52,630 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand 5 states. [2018-11-14 16:43:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:54,030 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2018-11-14 16:43:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:54,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 16:43:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2018-11-14 16:43:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2018-11-14 16:43:54,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 192 transitions. [2018-11-14 16:43:54,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:54,691 INFO L225 Difference]: With dead ends: 169 [2018-11-14 16:43:54,691 INFO L226 Difference]: Without dead ends: 167 [2018-11-14 16:43:54,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-14 16:43:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2018-11-14 16:43:54,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:54,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 130 states. [2018-11-14 16:43:54,701 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 130 states. [2018-11-14 16:43:54,701 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 130 states. [2018-11-14 16:43:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:54,706 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-14 16:43:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-14 16:43:54,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:54,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:54,706 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 167 states. [2018-11-14 16:43:54,706 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 167 states. [2018-11-14 16:43:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:54,710 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-14 16:43:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-14 16:43:54,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:54,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:54,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:54,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-14 16:43:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-11-14 16:43:54,714 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 18 [2018-11-14 16:43:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:54,715 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-11-14 16:43:54,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-11-14 16:43:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:43:54,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:54,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:54,716 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:54,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-14 16:43:54,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:54,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:55,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {6633#true} call ULTIMATE.init(); {6633#true} is VALID [2018-11-14 16:43:55,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {6633#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {6633#true} is VALID [2018-11-14 16:43:55,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {6633#true} assume true; {6633#true} is VALID [2018-11-14 16:43:55,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6633#true} {6633#true} #388#return; {6633#true} is VALID [2018-11-14 16:43:55,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {6633#true} call #t~ret15 := main(); {6633#true} is VALID [2018-11-14 16:43:55,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6633#true} is VALID [2018-11-14 16:43:55,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {6633#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {6656#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:55,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {6656#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:43:55,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:43:55,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {6660#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6667#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-14 16:43:55,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {6667#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:55,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:55,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:55,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:55,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_6~0 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:43:55,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {6671#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6687#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:55,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {6687#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~13 == 0bv32; {6634#false} is VALID [2018-11-14 16:43:55,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {6634#false} assume !false; {6634#false} is VALID [2018-11-14 16:43:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:55,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:55,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:43:55,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:43:55,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:55,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:43:55,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:55,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:43:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:43:55,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:55,526 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 7 states. [2018-11-14 16:43:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:56,765 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2018-11-14 16:43:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:43:56,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:43:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2018-11-14 16:43:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2018-11-14 16:43:56,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 157 transitions. [2018-11-14 16:43:56,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:56,951 INFO L225 Difference]: With dead ends: 136 [2018-11-14 16:43:56,951 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 16:43:56,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 16:43:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-11-14 16:43:56,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:56,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 129 states. [2018-11-14 16:43:56,961 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 129 states. [2018-11-14 16:43:56,961 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 129 states. [2018-11-14 16:43:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:56,964 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-14 16:43:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-11-14 16:43:56,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:56,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 132 states. [2018-11-14 16:43:56,965 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 132 states. [2018-11-14 16:43:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:56,967 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-14 16:43:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-11-14 16:43:56,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:56,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:56,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:56,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-14 16:43:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-11-14 16:43:56,969 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 18 [2018-11-14 16:43:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:56,970 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-11-14 16:43:56,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:43:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-11-14 16:43:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:43:56,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:56,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:56,971 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:56,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash -481853988, now seen corresponding path program 1 times [2018-11-14 16:43:56,971 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:56,971 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:56,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:57,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:57,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {7244#true} call ULTIMATE.init(); {7244#true} is VALID [2018-11-14 16:43:57,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {7244#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {7244#true} is VALID [2018-11-14 16:43:57,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {7244#true} assume true; {7244#true} is VALID [2018-11-14 16:43:57,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7244#true} {7244#true} #388#return; {7244#true} is VALID [2018-11-14 16:43:57,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {7244#true} call #t~ret15 := main(); {7244#true} is VALID [2018-11-14 16:43:57,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {7244#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7244#true} is VALID [2018-11-14 16:43:57,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {7244#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {7267#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {7267#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {7280#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {7280#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {7293#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {7293#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {7293#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:43:57,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {7293#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7300#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:57,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {7300#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {7245#false} is VALID [2018-11-14 16:43:57,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {7245#false} assume !false; {7245#false} is VALID [2018-11-14 16:43:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:57,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:57,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:57,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:57,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:43:57,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:57,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:57,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:57,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:57,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:57,179 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 6 states. [2018-11-14 16:43:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:58,865 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2018-11-14 16:43:58,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:58,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:43:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-14 16:43:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2018-11-14 16:43:58,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 198 transitions. [2018-11-14 16:43:59,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:59,155 INFO L225 Difference]: With dead ends: 176 [2018-11-14 16:43:59,155 INFO L226 Difference]: Without dead ends: 174 [2018-11-14 16:43:59,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-14 16:43:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2018-11-14 16:43:59,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:59,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 133 states. [2018-11-14 16:43:59,180 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 133 states. [2018-11-14 16:43:59,181 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 133 states. [2018-11-14 16:43:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:59,184 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-14 16:43:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-14 16:43:59,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:59,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:59,185 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 174 states. [2018-11-14 16:43:59,185 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 174 states. [2018-11-14 16:43:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:59,188 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-14 16:43:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-14 16:43:59,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:59,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:59,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:59,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-14 16:43:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-11-14 16:43:59,192 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 19 [2018-11-14 16:43:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:59,192 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-11-14 16:43:59,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-11-14 16:43:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:43:59,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:59,193 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:59,194 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:59,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash 102497833, now seen corresponding path program 1 times [2018-11-14 16:43:59,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:59,195 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:59,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:59,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {7989#true} call ULTIMATE.init(); {7989#true} is VALID [2018-11-14 16:43:59,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {7989#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {7989#true} is VALID [2018-11-14 16:43:59,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {7989#true} assume true; {7989#true} is VALID [2018-11-14 16:43:59,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7989#true} {7989#true} #388#return; {7989#true} is VALID [2018-11-14 16:43:59,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {7989#true} call #t~ret15 := main(); {7989#true} is VALID [2018-11-14 16:43:59,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {7989#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7989#true} is VALID [2018-11-14 16:43:59,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {7989#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {8012#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {8012#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {8025#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {8025#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8038#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {8038#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {8038#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:43:59,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {8038#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8045#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:59,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {8045#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {7990#false} is VALID [2018-11-14 16:43:59,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {7990#false} assume !false; {7990#false} is VALID [2018-11-14 16:43:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:59,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:59,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:59,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:43:59,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:59,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:59,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:59,562 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 6 states. [2018-11-14 16:44:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:01,305 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2018-11-14 16:44:01,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:01,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:44:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-14 16:44:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-14 16:44:01,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2018-11-14 16:44:01,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:01,602 INFO L225 Difference]: With dead ends: 174 [2018-11-14 16:44:01,603 INFO L226 Difference]: Without dead ends: 172 [2018-11-14 16:44:01,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-14 16:44:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2018-11-14 16:44:01,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:01,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 135 states. [2018-11-14 16:44:01,662 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 135 states. [2018-11-14 16:44:01,662 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 135 states. [2018-11-14 16:44:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:01,666 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-11-14 16:44:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-11-14 16:44:01,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:01,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:01,667 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 172 states. [2018-11-14 16:44:01,667 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 172 states. [2018-11-14 16:44:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:01,670 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-11-14 16:44:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-11-14 16:44:01,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:01,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:01,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:01,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-14 16:44:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2018-11-14 16:44:01,673 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 19 [2018-11-14 16:44:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:01,674 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2018-11-14 16:44:01,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2018-11-14 16:44:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:44:01,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:01,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:01,675 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:01,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-14 16:44:01,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:01,675 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:01,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:01,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:02,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {8731#true} call ULTIMATE.init(); {8731#true} is VALID [2018-11-14 16:44:02,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {8731#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {8731#true} is VALID [2018-11-14 16:44:02,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {8731#true} assume true; {8731#true} is VALID [2018-11-14 16:44:02,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8731#true} {8731#true} #388#return; {8731#true} is VALID [2018-11-14 16:44:02,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {8731#true} call #t~ret15 := main(); {8731#true} is VALID [2018-11-14 16:44:02,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {8731#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8731#true} is VALID [2018-11-14 16:44:02,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {8731#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8754#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:02,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {8754#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:02,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:02,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {8758#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8765#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-14 16:44:02,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {8765#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:02,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:02,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:02,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:02,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(~main____CPAchecker_TMP_4~0 == 0bv32); {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:02,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:02,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {8769#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8788#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:02,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {8788#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {8732#false} is VALID [2018-11-14 16:44:02,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {8732#false} assume !false; {8732#false} is VALID [2018-11-14 16:44:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:02,111 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:02,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:02,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:02,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-14 16:44:02,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:02,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:02,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:02,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:02,166 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand 7 states. [2018-11-14 16:44:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,449 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-11-14 16:44:03,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:03,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-14 16:44:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2018-11-14 16:44:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2018-11-14 16:44:03,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 187 transitions. [2018-11-14 16:44:03,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:03,654 INFO L225 Difference]: With dead ends: 169 [2018-11-14 16:44:03,654 INFO L226 Difference]: Without dead ends: 167 [2018-11-14 16:44:03,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-14 16:44:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2018-11-14 16:44:03,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:03,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 135 states. [2018-11-14 16:44:03,682 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 135 states. [2018-11-14 16:44:03,682 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 135 states. [2018-11-14 16:44:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,686 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-11-14 16:44:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-11-14 16:44:03,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:03,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:03,686 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 167 states. [2018-11-14 16:44:03,686 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 167 states. [2018-11-14 16:44:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,689 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2018-11-14 16:44:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-11-14 16:44:03,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:03,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:03,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:03,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-14 16:44:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-11-14 16:44:03,692 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 19 [2018-11-14 16:44:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:03,692 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-11-14 16:44:03,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-11-14 16:44:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:44:03,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:03,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:03,693 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:03,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2052568648, now seen corresponding path program 1 times [2018-11-14 16:44:03,694 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:03,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:03,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:03,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2018-11-14 16:44:03,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {9460#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {9460#true} is VALID [2018-11-14 16:44:03,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2018-11-14 16:44:03,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #388#return; {9460#true} is VALID [2018-11-14 16:44:03,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret15 := main(); {9460#true} is VALID [2018-11-14 16:44:03,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {9460#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9460#true} is VALID [2018-11-14 16:44:03,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {9460#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {9483#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {9483#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9496#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {9496#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {9509#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {9509#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {9509#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:03,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {9509#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9516#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:44:03,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {9516#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9520#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:03,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {9520#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {9461#false} is VALID [2018-11-14 16:44:03,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2018-11-14 16:44:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:03,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:03,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:03,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:03,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 16:44:03,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:03,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:03,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:03,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:03,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:03,884 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 7 states. [2018-11-14 16:44:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:05,473 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2018-11-14 16:44:05,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:05,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 16:44:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2018-11-14 16:44:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2018-11-14 16:44:05,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 192 transitions. [2018-11-14 16:44:05,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:05,699 INFO L225 Difference]: With dead ends: 170 [2018-11-14 16:44:05,699 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 16:44:05,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 16:44:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2018-11-14 16:44:05,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:05,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 134 states. [2018-11-14 16:44:05,724 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 134 states. [2018-11-14 16:44:05,724 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 134 states. [2018-11-14 16:44:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:05,727 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-14 16:44:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-11-14 16:44:05,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:05,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:05,728 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 166 states. [2018-11-14 16:44:05,728 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 166 states. [2018-11-14 16:44:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:05,731 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-14 16:44:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2018-11-14 16:44:05,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:05,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:05,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:05,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 16:44:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-11-14 16:44:05,734 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 20 [2018-11-14 16:44:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:05,735 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-11-14 16:44:05,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-11-14 16:44:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:44:05,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:05,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:05,736 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:05,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1117531412, now seen corresponding path program 1 times [2018-11-14 16:44:05,737 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:05,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:05,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {10189#true} call ULTIMATE.init(); {10189#true} is VALID [2018-11-14 16:44:05,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {10189#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {10189#true} is VALID [2018-11-14 16:44:05,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {10189#true} assume true; {10189#true} is VALID [2018-11-14 16:44:05,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10189#true} {10189#true} #388#return; {10189#true} is VALID [2018-11-14 16:44:05,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {10189#true} call #t~ret15 := main(); {10189#true} is VALID [2018-11-14 16:44:05,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {10189#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10189#true} is VALID [2018-11-14 16:44:05,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {10189#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10212#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {10212#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {10225#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {10225#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10238#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:05,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {10238#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:44:05,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:44:05,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {10242#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10249#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:05,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {10249#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {10190#false} is VALID [2018-11-14 16:44:05,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {10190#false} assume !false; {10190#false} is VALID [2018-11-14 16:44:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:05,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:05,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:05,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:05,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 16:44:05,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:05,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:06,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:06,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:06,009 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 7 states. [2018-11-14 16:44:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:07,982 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2018-11-14 16:44:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:07,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 16:44:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2018-11-14 16:44:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2018-11-14 16:44:07,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 188 transitions. [2018-11-14 16:44:08,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:08,188 INFO L225 Difference]: With dead ends: 166 [2018-11-14 16:44:08,189 INFO L226 Difference]: Without dead ends: 161 [2018-11-14 16:44:08,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-14 16:44:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 132. [2018-11-14 16:44:08,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:08,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 132 states. [2018-11-14 16:44:08,201 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 132 states. [2018-11-14 16:44:08,201 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 132 states. [2018-11-14 16:44:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:08,205 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-14 16:44:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-11-14 16:44:08,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:08,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:08,206 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 161 states. [2018-11-14 16:44:08,206 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 161 states. [2018-11-14 16:44:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:08,209 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-14 16:44:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-11-14 16:44:08,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:08,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:08,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:08,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-14 16:44:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-11-14 16:44:08,212 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 20 [2018-11-14 16:44:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:08,213 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-11-14 16:44:08,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-11-14 16:44:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:44:08,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:08,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:08,214 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:08,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:08,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-14 16:44:08,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:08,215 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:08,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:08,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:08,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {10901#true} call ULTIMATE.init(); {10901#true} is VALID [2018-11-14 16:44:08,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {10901#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {10901#true} is VALID [2018-11-14 16:44:08,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {10901#true} assume true; {10901#true} is VALID [2018-11-14 16:44:08,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10901#true} {10901#true} #388#return; {10901#true} is VALID [2018-11-14 16:44:08,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {10901#true} call #t~ret15 := main(); {10901#true} is VALID [2018-11-14 16:44:08,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {10901#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10901#true} is VALID [2018-11-14 16:44:08,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {10901#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10924#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {10924#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10937#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {10937#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10956#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:08,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {10956#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10960#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:08,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {10960#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~8 == 0bv32; {10902#false} is VALID [2018-11-14 16:44:08,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {10902#false} assume !false; {10902#false} is VALID [2018-11-14 16:44:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:08,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:08,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:08,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:08,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:44:08,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:08,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:08,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:08,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:08,394 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 6 states. [2018-11-14 16:44:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:09,856 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-11-14 16:44:09,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:09,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:44:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2018-11-14 16:44:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2018-11-14 16:44:09,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 183 transitions. [2018-11-14 16:44:10,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:10,079 INFO L225 Difference]: With dead ends: 161 [2018-11-14 16:44:10,079 INFO L226 Difference]: Without dead ends: 159 [2018-11-14 16:44:10,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-14 16:44:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-11-14 16:44:10,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:10,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 134 states. [2018-11-14 16:44:10,138 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 134 states. [2018-11-14 16:44:10,138 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 134 states. [2018-11-14 16:44:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:10,140 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-14 16:44:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-11-14 16:44:10,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:10,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:10,141 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 159 states. [2018-11-14 16:44:10,141 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 159 states. [2018-11-14 16:44:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:10,144 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-14 16:44:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2018-11-14 16:44:10,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:10,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:10,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:10,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 16:44:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-11-14 16:44:10,147 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 20 [2018-11-14 16:44:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:10,147 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-11-14 16:44:10,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-11-14 16:44:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:44:10,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:10,148 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:10,149 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:10,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:10,149 INFO L82 PathProgramCache]: Analyzing trace with hash 808149389, now seen corresponding path program 1 times [2018-11-14 16:44:10,149 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:10,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:10,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:10,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {11604#true} call ULTIMATE.init(); {11604#true} is VALID [2018-11-14 16:44:10,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {11604#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {11604#true} is VALID [2018-11-14 16:44:10,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {11604#true} assume true; {11604#true} is VALID [2018-11-14 16:44:10,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11604#true} {11604#true} #388#return; {11604#true} is VALID [2018-11-14 16:44:10,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {11604#true} call #t~ret15 := main(); {11604#true} is VALID [2018-11-14 16:44:10,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {11604#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11604#true} is VALID [2018-11-14 16:44:10,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {11604#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11627#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {11627#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {11640#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {11640#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {11653#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:10,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {11653#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11666#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:10,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {11666#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~6 == 0bv32; {11605#false} is VALID [2018-11-14 16:44:10,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {11605#false} assume !false; {11605#false} is VALID [2018-11-14 16:44:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:10,319 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:10,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:10,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:10,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 16:44:10,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:10,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:10,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:10,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:10,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:10,354 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 6 states. [2018-11-14 16:44:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:12,005 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-11-14 16:44:12,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:12,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 16:44:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2018-11-14 16:44:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2018-11-14 16:44:12,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 221 transitions. [2018-11-14 16:44:12,294 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-14 16:44:12,297 INFO L225 Difference]: With dead ends: 197 [2018-11-14 16:44:12,297 INFO L226 Difference]: Without dead ends: 195 [2018-11-14 16:44:12,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-14 16:44:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 137. [2018-11-14 16:44:12,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:12,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 137 states. [2018-11-14 16:44:12,364 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 137 states. [2018-11-14 16:44:12,364 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 137 states. [2018-11-14 16:44:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:12,368 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-14 16:44:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-11-14 16:44:12,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:12,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:12,369 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 195 states. [2018-11-14 16:44:12,369 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 195 states. [2018-11-14 16:44:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:12,373 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-11-14 16:44:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-11-14 16:44:12,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:12,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:12,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:12,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-14 16:44:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2018-11-14 16:44:12,376 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2018-11-14 16:44:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:12,376 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2018-11-14 16:44:12,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2018-11-14 16:44:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:44:12,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:12,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:12,377 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:12,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:12,378 INFO L82 PathProgramCache]: Analyzing trace with hash 809688589, now seen corresponding path program 1 times [2018-11-14 16:44:12,378 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:12,378 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:12,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:12,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {12426#true} call ULTIMATE.init(); {12426#true} is VALID [2018-11-14 16:44:12,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {12426#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {12426#true} is VALID [2018-11-14 16:44:12,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {12426#true} assume true; {12426#true} is VALID [2018-11-14 16:44:12,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12426#true} {12426#true} #388#return; {12426#true} is VALID [2018-11-14 16:44:12,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {12426#true} call #t~ret15 := main(); {12426#true} is VALID [2018-11-14 16:44:12,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {12426#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12426#true} is VALID [2018-11-14 16:44:12,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {12426#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {12449#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {12449#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {12462#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {12462#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {12475#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:12,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {12475#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {12488#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:12,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {12488#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {12427#false} is VALID [2018-11-14 16:44:12,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {12427#false} assume !false; {12427#false} is VALID [2018-11-14 16:44:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:12,521 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:12,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:12,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:12,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 16:44:12,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:12,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:12,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:12,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:12,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:12,617 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 6 states. [2018-11-14 16:44:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:14,142 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-11-14 16:44:14,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:14,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 16:44:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2018-11-14 16:44:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2018-11-14 16:44:14,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 179 transitions. [2018-11-14 16:44:14,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:14,422 INFO L225 Difference]: With dead ends: 157 [2018-11-14 16:44:14,422 INFO L226 Difference]: Without dead ends: 155 [2018-11-14 16:44:14,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-14 16:44:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2018-11-14 16:44:14,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:14,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 139 states. [2018-11-14 16:44:14,433 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 139 states. [2018-11-14 16:44:14,434 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 139 states. [2018-11-14 16:44:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:14,436 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-11-14 16:44:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-11-14 16:44:14,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:14,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:14,437 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 155 states. [2018-11-14 16:44:14,437 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 155 states. [2018-11-14 16:44:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:14,440 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-11-14 16:44:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-11-14 16:44:14,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:14,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:14,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:14,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 16:44:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2018-11-14 16:44:14,443 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 21 [2018-11-14 16:44:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:14,443 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2018-11-14 16:44:14,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2018-11-14 16:44:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:44:14,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:14,444 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:14,444 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:14,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1797106325, now seen corresponding path program 1 times [2018-11-14 16:44:14,445 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:14,445 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:14,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:14,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:14,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {13125#true} call ULTIMATE.init(); {13125#true} is VALID [2018-11-14 16:44:14,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {13125#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {13125#true} is VALID [2018-11-14 16:44:14,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {13125#true} assume true; {13125#true} is VALID [2018-11-14 16:44:14,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13125#true} {13125#true} #388#return; {13125#true} is VALID [2018-11-14 16:44:14,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {13125#true} call #t~ret15 := main(); {13125#true} is VALID [2018-11-14 16:44:14,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {13125#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13125#true} is VALID [2018-11-14 16:44:14,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {13125#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13148#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {13148#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13161#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {13161#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13180#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {13180#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {13180#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:14,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {13180#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {13187#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:14,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {13187#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {13126#false} is VALID [2018-11-14 16:44:14,657 INFO L273 TraceCheckUtils]: 20: Hoare triple {13126#false} assume !false; {13126#false} is VALID [2018-11-14 16:44:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:14,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:14,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:14,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:44:14,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 16:44:14,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:14,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:14,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:14,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:14,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:14,708 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 6 states. [2018-11-14 16:44:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:16,367 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2018-11-14 16:44:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:16,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 16:44:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2018-11-14 16:44:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2018-11-14 16:44:16,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 226 transitions. [2018-11-14 16:44:16,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:16,626 INFO L225 Difference]: With dead ends: 200 [2018-11-14 16:44:16,626 INFO L226 Difference]: Without dead ends: 198 [2018-11-14 16:44:16,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-14 16:44:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 141. [2018-11-14 16:44:16,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:16,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 141 states. [2018-11-14 16:44:16,655 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 141 states. [2018-11-14 16:44:16,656 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 141 states. [2018-11-14 16:44:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:16,659 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-14 16:44:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-11-14 16:44:16,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:16,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:16,660 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 198 states. [2018-11-14 16:44:16,660 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 198 states. [2018-11-14 16:44:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:16,663 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2018-11-14 16:44:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-11-14 16:44:16,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:16,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:16,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:16,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-14 16:44:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-11-14 16:44:16,665 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 21 [2018-11-14 16:44:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:16,665 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-11-14 16:44:16,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-11-14 16:44:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:44:16,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:16,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:16,667 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:16,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-14 16:44:16,667 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:16,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:16,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:16,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:16,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {13962#true} call ULTIMATE.init(); {13962#true} is VALID [2018-11-14 16:44:16,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {13962#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {13962#true} is VALID [2018-11-14 16:44:16,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {13962#true} assume true; {13962#true} is VALID [2018-11-14 16:44:16,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13962#true} {13962#true} #388#return; {13962#true} is VALID [2018-11-14 16:44:16,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {13962#true} call #t~ret15 := main(); {13962#true} is VALID [2018-11-14 16:44:16,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {13962#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {13962#true} is VALID [2018-11-14 16:44:16,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13985#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {13985#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13998#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {13998#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14017#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:16,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {14017#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {14021#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:44:16,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {14021#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {14025#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:16,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {14025#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {13963#false} is VALID [2018-11-14 16:44:16,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {13963#false} assume !false; {13963#false} is VALID [2018-11-14 16:44:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:16,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:16,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:16,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:16,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 16:44:16,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:16,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:16,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:16,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:16,881 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 7 states. [2018-11-14 16:44:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,500 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-11-14 16:44:18,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:18,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 16:44:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2018-11-14 16:44:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2018-11-14 16:44:18,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 175 transitions. [2018-11-14 16:44:18,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:18,704 INFO L225 Difference]: With dead ends: 153 [2018-11-14 16:44:18,705 INFO L226 Difference]: Without dead ends: 149 [2018-11-14 16:44:18,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-14 16:44:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2018-11-14 16:44:18,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:18,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 140 states. [2018-11-14 16:44:18,715 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 140 states. [2018-11-14 16:44:18,715 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 140 states. [2018-11-14 16:44:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,719 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-11-14 16:44:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-11-14 16:44:18,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:18,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:18,720 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 149 states. [2018-11-14 16:44:18,720 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 149 states. [2018-11-14 16:44:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,722 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-11-14 16:44:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-11-14 16:44:18,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:18,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:18,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:18,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 16:44:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-11-14 16:44:18,726 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 21 [2018-11-14 16:44:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:18,726 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-11-14 16:44:18,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-11-14 16:44:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:44:18,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:18,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:18,727 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:18,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:18,728 INFO L82 PathProgramCache]: Analyzing trace with hash -717169605, now seen corresponding path program 1 times [2018-11-14 16:44:18,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:18,728 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:18,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:18,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:19,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {14648#true} call ULTIMATE.init(); {14648#true} is VALID [2018-11-14 16:44:19,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {14648#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {14648#true} is VALID [2018-11-14 16:44:19,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {14648#true} assume true; {14648#true} is VALID [2018-11-14 16:44:19,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14648#true} {14648#true} #388#return; {14648#true} is VALID [2018-11-14 16:44:19,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {14648#true} call #t~ret15 := main(); {14648#true} is VALID [2018-11-14 16:44:19,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {14648#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14648#true} is VALID [2018-11-14 16:44:19,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {14648#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14671#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:19,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {14671#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:19,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:19,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {14675#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {14682#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:19,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {14682#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14686#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:19,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {14686#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:19,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:19,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:19,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {14690#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:19,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:19,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:19,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:19,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:19,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {14700#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {14716#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:19,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {14716#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {14649#false} is VALID [2018-11-14 16:44:19,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {14649#false} assume !false; {14649#false} is VALID [2018-11-14 16:44:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:19,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:19,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:44:19,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-14 16:44:19,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:19,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:44:19,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:19,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:44:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:44:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:19,095 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand 9 states. [2018-11-14 16:44:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:21,777 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-11-14 16:44:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:44:21,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-14 16:44:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2018-11-14 16:44:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2018-11-14 16:44:21,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 194 transitions. [2018-11-14 16:44:21,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:21,995 INFO L225 Difference]: With dead ends: 192 [2018-11-14 16:44:21,995 INFO L226 Difference]: Without dead ends: 190 [2018-11-14 16:44:21,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-14 16:44:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 146. [2018-11-14 16:44:22,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:22,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 146 states. [2018-11-14 16:44:22,279 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 146 states. [2018-11-14 16:44:22,280 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 146 states. [2018-11-14 16:44:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:22,282 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-14 16:44:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-14 16:44:22,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:22,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:22,283 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 190 states. [2018-11-14 16:44:22,283 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 190 states. [2018-11-14 16:44:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:22,287 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2018-11-14 16:44:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-14 16:44:22,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:22,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:22,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:22,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 16:44:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2018-11-14 16:44:22,290 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 22 [2018-11-14 16:44:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:22,290 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2018-11-14 16:44:22,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:44:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2018-11-14 16:44:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:44:22,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:22,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:22,292 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:22,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:22,292 INFO L82 PathProgramCache]: Analyzing trace with hash -669454355, now seen corresponding path program 1 times [2018-11-14 16:44:22,292 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:22,292 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-14 16:44:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:22,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:22,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {15471#true} call ULTIMATE.init(); {15471#true} is VALID [2018-11-14 16:44:22,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {15471#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {15471#true} is VALID [2018-11-14 16:44:22,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {15471#true} assume true; {15471#true} is VALID [2018-11-14 16:44:22,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15471#true} {15471#true} #388#return; {15471#true} is VALID [2018-11-14 16:44:22,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {15471#true} call #t~ret15 := main(); {15471#true} is VALID [2018-11-14 16:44:22,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {15471#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15471#true} is VALID [2018-11-14 16:44:22,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {15471#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15494#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:22,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {15494#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:22,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:22,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {15498#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {15505#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:22,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {15505#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15509#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:22,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {15509#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:22,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:22,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:22,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {15513#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:22,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:22,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:22,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:22,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_6~0 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:22,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {15523#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~12 == 0bv32);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {15539#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:22,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {15539#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~13 == 0bv32; {15472#false} is VALID [2018-11-14 16:44:22,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {15472#false} assume !false; {15472#false} is VALID [2018-11-14 16:44:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:22,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:22,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:22,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:44:22,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-14 16:44:22,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:22,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:44:22,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:22,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:44:22,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:44:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:22,642 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand 9 states. [2018-11-14 16:44:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:24,695 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2018-11-14 16:44:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:44:24,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-14 16:44:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-14 16:44:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2018-11-14 16:44:24,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 156 transitions. [2018-11-14 16:44:24,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:24,877 INFO L225 Difference]: With dead ends: 156 [2018-11-14 16:44:24,878 INFO L226 Difference]: Without dead ends: 152 [2018-11-14 16:44:24,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-14 16:44:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-11-14 16:44:24,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:24,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 147 states. [2018-11-14 16:44:24,896 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 147 states. [2018-11-14 16:44:24,896 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 147 states. [2018-11-14 16:44:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:24,899 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-14 16:44:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-14 16:44:24,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:24,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:24,900 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 152 states. [2018-11-14 16:44:24,900 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 152 states. [2018-11-14 16:44:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:24,902 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-14 16:44:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-14 16:44:24,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:24,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:24,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:24,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-14 16:44:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-11-14 16:44:24,906 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 22 [2018-11-14 16:44:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:24,906 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-11-14 16:44:24,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:44:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-11-14 16:44:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:44:24,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:24,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:24,908 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:24,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash 124281916, now seen corresponding path program 1 times [2018-11-14 16:44:24,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:24,909 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-14 16:44:24,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:25,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:25,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {16181#true} call ULTIMATE.init(); {16181#true} is VALID [2018-11-14 16:44:25,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {16181#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {16181#true} is VALID [2018-11-14 16:44:25,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {16181#true} assume true; {16181#true} is VALID [2018-11-14 16:44:25,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16181#true} {16181#true} #388#return; {16181#true} is VALID [2018-11-14 16:44:25,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {16181#true} call #t~ret15 := main(); {16181#true} is VALID [2018-11-14 16:44:25,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {16181#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16181#true} is VALID [2018-11-14 16:44:25,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {16181#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {16204#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:25,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {16204#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:25,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:25,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {16208#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {16215#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-14 16:44:25,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {16215#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:25,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:25,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {16219#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:25,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:25,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:25,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:25,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {16226#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:25,231 INFO L273 TraceCheckUtils]: 17: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:25,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:25,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {16239#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {16249#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:25,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {16249#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {16182#false} is VALID [2018-11-14 16:44:25,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#false} assume !false; {16182#false} is VALID [2018-11-14 16:44:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:25,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:44:25,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-14 16:44:25,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:25,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:44:25,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:25,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:44:25,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:44:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:25,270 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 9 states. [2018-11-14 16:44:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:27,887 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2018-11-14 16:44:27,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:44:27,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-14 16:44:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2018-11-14 16:44:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2018-11-14 16:44:27,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 209 transitions. [2018-11-14 16:44:28,143 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-14 16:44:28,147 INFO L225 Difference]: With dead ends: 194 [2018-11-14 16:44:28,147 INFO L226 Difference]: Without dead ends: 192 [2018-11-14 16:44:28,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:44:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-14 16:44:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 150. [2018-11-14 16:44:28,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:28,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 150 states. [2018-11-14 16:44:28,303 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 150 states. [2018-11-14 16:44:28,303 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 150 states. [2018-11-14 16:44:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,309 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-14 16:44:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-11-14 16:44:28,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,309 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 192 states. [2018-11-14 16:44:28,310 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 192 states. [2018-11-14 16:44:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,314 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2018-11-14 16:44:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2018-11-14 16:44:28,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:28,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-14 16:44:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-14 16:44:28,318 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 22 [2018-11-14 16:44:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:28,319 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-14 16:44:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:44:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-14 16:44:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:44:28,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:28,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:28,320 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash -715090112, now seen corresponding path program 1 times [2018-11-14 16:44:28,321 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:28,321 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-14 16:44:28,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:28,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:28,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {17018#true} call ULTIMATE.init(); {17018#true} is VALID [2018-11-14 16:44:28,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {17018#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {17018#true} is VALID [2018-11-14 16:44:28,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {17018#true} assume true; {17018#true} is VALID [2018-11-14 16:44:28,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17018#true} {17018#true} #388#return; {17018#true} is VALID [2018-11-14 16:44:28,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {17018#true} call #t~ret15 := main(); {17018#true} is VALID [2018-11-14 16:44:28,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {17018#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17018#true} is VALID [2018-11-14 16:44:28,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {17018#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:28,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {17041#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:28,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:28,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {17045#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {17052#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:28,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {17052#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~15 (_ bv0 32))) (and (= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17056#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:28,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {17056#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:28,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:28,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:28,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {17060#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:28,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:28,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:28,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:28,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(~main____CPAchecker_TMP_4~0 == 0bv32); {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:28,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:28,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {17070#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {17089#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:28,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {17089#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {17019#false} is VALID [2018-11-14 16:44:28,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {17019#false} assume !false; {17019#false} is VALID [2018-11-14 16:44:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:28,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:28,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:28,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:44:28,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-14 16:44:28,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:28,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:44:28,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:28,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:44:28,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:44:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:28,667 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 9 states. [2018-11-14 16:44:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:30,510 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2018-11-14 16:44:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:44:30,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-14 16:44:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2018-11-14 16:44:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:44:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2018-11-14 16:44:30,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 188 transitions. [2018-11-14 16:44:30,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:30,729 INFO L225 Difference]: With dead ends: 187 [2018-11-14 16:44:30,729 INFO L226 Difference]: Without dead ends: 185 [2018-11-14 16:44:30,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-14 16:44:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2018-11-14 16:44:30,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:30,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 148 states. [2018-11-14 16:44:30,748 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 148 states. [2018-11-14 16:44:30,748 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 148 states. [2018-11-14 16:44:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:30,753 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-11-14 16:44:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-14 16:44:30,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:30,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:30,753 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 185 states. [2018-11-14 16:44:30,753 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 185 states. [2018-11-14 16:44:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:30,757 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-11-14 16:44:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-14 16:44:30,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:30,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:30,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:30,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-14 16:44:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-11-14 16:44:30,761 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 23 [2018-11-14 16:44:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:30,761 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-11-14 16:44:30,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:44:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-11-14 16:44:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:44:30,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:30,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:30,762 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:30,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1709433728, now seen corresponding path program 1 times [2018-11-14 16:44:30,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:30,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:30,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {17831#true} call ULTIMATE.init(); {17831#true} is VALID [2018-11-14 16:44:30,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {17831#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {17831#true} is VALID [2018-11-14 16:44:30,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {17831#true} assume true; {17831#true} is VALID [2018-11-14 16:44:30,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17831#true} {17831#true} #388#return; {17831#true} is VALID [2018-11-14 16:44:30,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {17831#true} call #t~ret15 := main(); {17831#true} is VALID [2018-11-14 16:44:30,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {17831#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17831#true} is VALID [2018-11-14 16:44:30,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {17831#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {17854#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {17854#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {17867#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~2 == 0bv32);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~22 == 0bv32);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {17880#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {17880#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~23 == 0bv32);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17893#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {17893#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {17893#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:30,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {17893#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {17900#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:30,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {17900#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {17832#false} is VALID [2018-11-14 16:44:30,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {17832#false} assume !false; {17832#false} is VALID [2018-11-14 16:44:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:30,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:30,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:30,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:30,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 16:44:30,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:30,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:30,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:30,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:30,972 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 7 states. [2018-11-14 16:44:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:33,022 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2018-11-14 16:44:33,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:33,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 16:44:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2018-11-14 16:44:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2018-11-14 16:44:33,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 214 transitions. [2018-11-14 16:44:33,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:33,849 INFO L225 Difference]: With dead ends: 198 [2018-11-14 16:44:33,849 INFO L226 Difference]: Without dead ends: 196 [2018-11-14 16:44:33,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-14 16:44:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 150. [2018-11-14 16:44:33,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:33,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 150 states. [2018-11-14 16:44:33,868 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 150 states. [2018-11-14 16:44:33,868 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 150 states. [2018-11-14 16:44:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:33,874 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-14 16:44:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-11-14 16:44:33,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:33,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:33,874 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 196 states. [2018-11-14 16:44:33,874 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 196 states. [2018-11-14 16:44:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:33,878 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-14 16:44:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-11-14 16:44:33,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:33,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:33,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:33,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-14 16:44:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-14 16:44:33,881 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 23 [2018-11-14 16:44:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:33,881 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-14 16:44:33,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-14 16:44:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:44:33,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:33,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:33,883 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:33,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1124307341, now seen corresponding path program 1 times [2018-11-14 16:44:33,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:33,884 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:33,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:34,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {18678#true} call ULTIMATE.init(); {18678#true} is VALID [2018-11-14 16:44:34,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {18678#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {18678#true} is VALID [2018-11-14 16:44:34,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {18678#true} assume true; {18678#true} is VALID [2018-11-14 16:44:34,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18678#true} {18678#true} #388#return; {18678#true} is VALID [2018-11-14 16:44:34,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {18678#true} call #t~ret15 := main(); {18678#true} is VALID [2018-11-14 16:44:34,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {18678#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18678#true} is VALID [2018-11-14 16:44:34,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {18678#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {18701#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {18701#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {18714#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {18714#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~2 == 0bv32);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~20 == 0bv32);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {18727#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {18727#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~21 == 0bv32);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {18740#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {18740#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {18740#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:34,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {18740#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {18747#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:34,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {18747#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {18679#false} is VALID [2018-11-14 16:44:34,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {18679#false} assume !false; {18679#false} is VALID [2018-11-14 16:44:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:34,052 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:34,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 16:44:34,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:34,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:34,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:34,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:34,086 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 7 states. [2018-11-14 16:44:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,499 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2018-11-14 16:44:36,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:36,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 16:44:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-11-14 16:44:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2018-11-14 16:44:36,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 212 transitions. [2018-11-14 16:44:36,725 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-14 16:44:36,729 INFO L225 Difference]: With dead ends: 196 [2018-11-14 16:44:36,729 INFO L226 Difference]: Without dead ends: 194 [2018-11-14 16:44:36,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-14 16:44:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 153. [2018-11-14 16:44:36,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:36,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 153 states. [2018-11-14 16:44:36,750 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 153 states. [2018-11-14 16:44:36,750 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 153 states. [2018-11-14 16:44:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,753 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-14 16:44:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-11-14 16:44:36,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:36,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:36,754 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 194 states. [2018-11-14 16:44:36,754 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 194 states. [2018-11-14 16:44:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,757 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-14 16:44:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-11-14 16:44:36,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:36,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:36,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:36,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-14 16:44:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-14 16:44:36,759 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 23 [2018-11-14 16:44:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:36,760 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-14 16:44:36,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-14 16:44:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:44:36,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:36,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:36,761 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:36,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2005126242, now seen corresponding path program 1 times [2018-11-14 16:44:36,761 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:36,761 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:36,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:36,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {19523#true} call ULTIMATE.init(); {19523#true} is VALID [2018-11-14 16:44:36,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {19523#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {19523#true} is VALID [2018-11-14 16:44:36,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {19523#true} assume true; {19523#true} is VALID [2018-11-14 16:44:36,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19523#true} {19523#true} #388#return; {19523#true} is VALID [2018-11-14 16:44:36,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {19523#true} call #t~ret15 := main(); {19523#true} is VALID [2018-11-14 16:44:36,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {19523#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {19523#true} is VALID [2018-11-14 16:44:36,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {19523#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {19546#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {19546#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {19559#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {19559#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {19572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {19572#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19591#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:36,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {19591#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {19595#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:36,941 INFO L273 TraceCheckUtils]: 22: Hoare triple {19595#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~8 == 0bv32; {19524#false} is VALID [2018-11-14 16:44:36,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {19524#false} assume !false; {19524#false} is VALID [2018-11-14 16:44:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:36,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:36,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:36,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-14 16:44:36,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:36,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:36,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:36,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:36,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:36,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:36,974 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 7 states. [2018-11-14 16:44:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:39,033 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-14 16:44:39,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:39,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-14 16:44:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2018-11-14 16:44:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2018-11-14 16:44:39,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 210 transitions. [2018-11-14 16:44:39,262 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-14 16:44:39,265 INFO L225 Difference]: With dead ends: 194 [2018-11-14 16:44:39,266 INFO L226 Difference]: Without dead ends: 192 [2018-11-14 16:44:39,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-14 16:44:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2018-11-14 16:44:39,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:39,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 156 states. [2018-11-14 16:44:39,344 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 156 states. [2018-11-14 16:44:39,345 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 156 states. [2018-11-14 16:44:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:39,348 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-14 16:44:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-11-14 16:44:39,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:39,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:39,349 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 192 states. [2018-11-14 16:44:39,349 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 192 states. [2018-11-14 16:44:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:39,352 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-14 16:44:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2018-11-14 16:44:39,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:39,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:39,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:39,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-14 16:44:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-11-14 16:44:39,355 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 24 [2018-11-14 16:44:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:39,356 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-11-14 16:44:39,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-11-14 16:44:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:44:39,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:39,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:39,357 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:39,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1452841077, now seen corresponding path program 1 times [2018-11-14 16:44:39,358 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:39,358 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 30 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 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:39,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:39,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2018-11-14 16:44:39,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {20368#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {20368#true} is VALID [2018-11-14 16:44:39,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {20368#true} assume true; {20368#true} is VALID [2018-11-14 16:44:39,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20368#true} {20368#true} #388#return; {20368#true} is VALID [2018-11-14 16:44:39,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {20368#true} call #t~ret15 := main(); {20368#true} is VALID [2018-11-14 16:44:39,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {20368#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20368#true} is VALID [2018-11-14 16:44:39,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {20368#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {20391#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {20391#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {20404#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {20404#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~2 == 0bv32);havoc ~__tmp_23~0;~__tmp_23~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~22 == 0bv32);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {20417#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {20417#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~23 == 0bv32);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20430#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:39,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {20430#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-14 16:44:39,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-14 16:44:39,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {20434#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20441#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:39,534 INFO L273 TraceCheckUtils]: 22: Hoare triple {20441#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {20369#false} is VALID [2018-11-14 16:44:39,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2018-11-14 16:44:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:39,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:39,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:39,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 16:44:39,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:44:39,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:39,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:44:39,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:39,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:44:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:44:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:39,564 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 8 states. [2018-11-14 16:44:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:42,128 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-11-14 16:44:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:42,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:44:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-11-14 16:44:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2018-11-14 16:44:42,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 208 transitions. [2018-11-14 16:44:42,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:42,359 INFO L225 Difference]: With dead ends: 192 [2018-11-14 16:44:42,359 INFO L226 Difference]: Without dead ends: 187 [2018-11-14 16:44:42,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-14 16:44:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-11-14 16:44:42,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:42,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 154 states. [2018-11-14 16:44:42,408 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 154 states. [2018-11-14 16:44:42,408 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 154 states. [2018-11-14 16:44:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:42,411 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-14 16:44:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-11-14 16:44:42,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:42,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:42,412 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 187 states. [2018-11-14 16:44:42,412 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 187 states. [2018-11-14 16:44:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:42,414 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-14 16:44:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2018-11-14 16:44:42,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:42,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:42,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:42,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-14 16:44:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-11-14 16:44:42,417 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 24 [2018-11-14 16:44:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:42,417 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-11-14 16:44:42,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:44:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-11-14 16:44:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:44:42,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:42,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:42,418 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:42,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash 493792295, now seen corresponding path program 1 times [2018-11-14 16:44:42,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:42,419 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 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 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:42,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:42,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {21199#true} call ULTIMATE.init(); {21199#true} is VALID [2018-11-14 16:44:42,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {21199#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {21199#true} is VALID [2018-11-14 16:44:42,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {21199#true} assume true; {21199#true} is VALID [2018-11-14 16:44:42,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21199#true} {21199#true} #388#return; {21199#true} is VALID [2018-11-14 16:44:42,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {21199#true} call #t~ret15 := main(); {21199#true} is VALID [2018-11-14 16:44:42,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {21199#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21199#true} is VALID [2018-11-14 16:44:42,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {21199#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {21222#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {21222#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {21235#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {21235#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~2 == 0bv32);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~20 == 0bv32);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {21248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {21248#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~21 == 0bv32);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {21261#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {21261#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {21261#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:42,775 INFO L273 TraceCheckUtils]: 20: Hoare triple {21261#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {21268#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-14 16:44:42,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {21268#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {21272#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:42,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {21272#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {21200#false} is VALID [2018-11-14 16:44:42,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {21200#false} assume !false; {21200#false} is VALID [2018-11-14 16:44:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:42,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:42,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 16:44:42,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:44:42,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:42,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:44:42,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:42,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:44:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:44:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:42,824 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 8 states. [2018-11-14 16:44:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:45,185 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-11-14 16:44:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:45,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 16:44:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2018-11-14 16:44:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2018-11-14 16:44:45,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 203 transitions. [2018-11-14 16:44:45,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:45,405 INFO L225 Difference]: With dead ends: 187 [2018-11-14 16:44:45,405 INFO L226 Difference]: Without dead ends: 183 [2018-11-14 16:44:45,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-14 16:44:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2018-11-14 16:44:45,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:45,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 153 states. [2018-11-14 16:44:45,452 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 153 states. [2018-11-14 16:44:45,452 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 153 states. [2018-11-14 16:44:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:45,455 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-11-14 16:44:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-11-14 16:44:45,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:45,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:45,456 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 183 states. [2018-11-14 16:44:45,456 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 183 states. [2018-11-14 16:44:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:45,458 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-11-14 16:44:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-11-14 16:44:45,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:45,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:45,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:45,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-14 16:44:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2018-11-14 16:44:45,461 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 24 [2018-11-14 16:44:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:45,462 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2018-11-14 16:44:45,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:44:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2018-11-14 16:44:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:44:45,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:45,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:45,463 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:45,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2028941227, now seen corresponding path program 1 times [2018-11-14 16:44:45,463 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 32 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 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:45,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:45,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {22015#true} call ULTIMATE.init(); {22015#true} is VALID [2018-11-14 16:44:45,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {22015#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {22015#true} is VALID [2018-11-14 16:44:45,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 16:44:45,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22015#true} {22015#true} #388#return; {22015#true} is VALID [2018-11-14 16:44:45,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {22015#true} call #t~ret15 := main(); {22015#true} is VALID [2018-11-14 16:44:45,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {22015#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {22015#true} is VALID [2018-11-14 16:44:45,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {22015#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {22038#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {22038#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {22051#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {22051#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {22064#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {22064#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22083#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {22083#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {22083#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:45,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {22083#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {22090#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:45,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {22090#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {22016#false} is VALID [2018-11-14 16:44:45,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {22016#false} assume !false; {22016#false} is VALID [2018-11-14 16:44:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:45,637 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:45,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:45,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:45,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:44:45,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:45,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:45,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:45,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:45,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:45,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:45,703 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 7 states. [2018-11-14 16:44:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:48,109 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2018-11-14 16:44:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:44:48,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:44:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2018-11-14 16:44:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2018-11-14 16:44:48,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 267 transitions. [2018-11-14 16:44:48,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:48,412 INFO L225 Difference]: With dead ends: 238 [2018-11-14 16:44:48,412 INFO L226 Difference]: Without dead ends: 236 [2018-11-14 16:44:48,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-14 16:44:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 158. [2018-11-14 16:44:48,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:48,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 158 states. [2018-11-14 16:44:48,440 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 158 states. [2018-11-14 16:44:48,440 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 158 states. [2018-11-14 16:44:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:48,445 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-11-14 16:44:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2018-11-14 16:44:48,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:48,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:48,445 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 236 states. [2018-11-14 16:44:48,445 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 236 states. [2018-11-14 16:44:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:48,450 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-11-14 16:44:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 265 transitions. [2018-11-14 16:44:48,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:48,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:48,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:48,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 16:44:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 187 transitions. [2018-11-14 16:44:48,453 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 187 transitions. Word has length 25 [2018-11-14 16:44:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:48,453 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 187 transitions. [2018-11-14 16:44:48,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 187 transitions. [2018-11-14 16:44:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:44:48,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:48,454 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:48,455 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2029368231, now seen corresponding path program 1 times [2018-11-14 16:44:48,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 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 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:48,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:48,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {23005#true} call ULTIMATE.init(); {23005#true} is VALID [2018-11-14 16:44:48,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {23005#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {23005#true} is VALID [2018-11-14 16:44:48,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {23005#true} assume true; {23005#true} is VALID [2018-11-14 16:44:48,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23005#true} {23005#true} #388#return; {23005#true} is VALID [2018-11-14 16:44:48,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {23005#true} call #t~ret15 := main(); {23005#true} is VALID [2018-11-14 16:44:48,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {23005#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23005#true} is VALID [2018-11-14 16:44:48,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {23005#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23028#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {23028#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {23041#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {23041#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {23054#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {23054#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~7 == 0bv32);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23073#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:48,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {23073#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23077#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-14 16:44:48,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {23077#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23081#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:48,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {23081#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {23006#false} is VALID [2018-11-14 16:44:48,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {23006#false} assume !false; {23006#false} is VALID [2018-11-14 16:44:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:48,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 16:44:48,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 16:44:48,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:48,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:44:48,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:48,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:44:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:44:48,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:44:48,710 INFO L87 Difference]: Start difference. First operand 158 states and 187 transitions. Second operand 8 states. [2018-11-14 16:44:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:50,716 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-11-14 16:44:50,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:50,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-14 16:44:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-14 16:44:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:44:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2018-11-14 16:44:50,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 197 transitions. [2018-11-14 16:44:50,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:50,932 INFO L225 Difference]: With dead ends: 181 [2018-11-14 16:44:50,932 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 16:44:50,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 16:44:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2018-11-14 16:44:50,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:50,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 157 states. [2018-11-14 16:44:50,973 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 157 states. [2018-11-14 16:44:50,973 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 157 states. [2018-11-14 16:44:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:50,975 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2018-11-14 16:44:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2018-11-14 16:44:50,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:50,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:50,976 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 177 states. [2018-11-14 16:44:50,976 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 177 states. [2018-11-14 16:44:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:50,979 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2018-11-14 16:44:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 202 transitions. [2018-11-14 16:44:50,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:50,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:50,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:50,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-14 16:44:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2018-11-14 16:44:50,982 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 25 [2018-11-14 16:44:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:50,982 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2018-11-14 16:44:50,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:44:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2018-11-14 16:44:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:44:50,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:50,983 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:50,983 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:50,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1859040002, now seen corresponding path program 1 times [2018-11-14 16:44:50,984 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 34 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 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:51,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:51,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:51,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {23811#true} call ULTIMATE.init(); {23811#true} is VALID [2018-11-14 16:44:51,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {23811#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {23811#true} is VALID [2018-11-14 16:44:51,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {23811#true} assume true; {23811#true} is VALID [2018-11-14 16:44:51,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23811#true} {23811#true} #388#return; {23811#true} is VALID [2018-11-14 16:44:51,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {23811#true} call #t~ret15 := main(); {23811#true} is VALID [2018-11-14 16:44:51,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {23811#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23811#true} is VALID [2018-11-14 16:44:51,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {23811#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {23834#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {23834#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {23847#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {23847#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~2 == 0bv32);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~20 == 0bv32);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {23860#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {23860#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~21 == 0bv32);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23873#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:51,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {23873#(= (_ bv3 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {23886#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:51,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {23886#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~6 == 0bv32; {23812#false} is VALID [2018-11-14 16:44:51,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {23812#false} assume !false; {23812#false} is VALID [2018-11-14 16:44:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:51,136 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:51,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:51,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:51,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:44:51,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:51,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:51,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:51,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:51,171 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 7 states. [2018-11-14 16:44:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:53,365 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2018-11-14 16:44:53,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:44:53,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:44:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2018-11-14 16:44:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2018-11-14 16:44:53,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 247 transitions. [2018-11-14 16:44:53,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:53,645 INFO L225 Difference]: With dead ends: 227 [2018-11-14 16:44:53,645 INFO L226 Difference]: Without dead ends: 225 [2018-11-14 16:44:53,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:44:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-14 16:44:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 158. [2018-11-14 16:44:53,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:53,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 158 states. [2018-11-14 16:44:53,669 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 158 states. [2018-11-14 16:44:53,669 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 158 states. [2018-11-14 16:44:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:53,674 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-14 16:44:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2018-11-14 16:44:53,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:53,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:53,675 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 225 states. [2018-11-14 16:44:53,675 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 225 states. [2018-11-14 16:44:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:53,679 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2018-11-14 16:44:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 254 transitions. [2018-11-14 16:44:53,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:53,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:53,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:53,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 16:44:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-11-14 16:44:53,682 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 25 [2018-11-14 16:44:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:53,682 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-11-14 16:44:53,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-11-14 16:44:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:44:53,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:53,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:53,683 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:53,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:53,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1857500802, now seen corresponding path program 1 times [2018-11-14 16:44:53,684 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:53,684 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 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 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:53,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:53,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:53,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {24768#true} call ULTIMATE.init(); {24768#true} is VALID [2018-11-14 16:44:53,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {24768#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {24768#true} is VALID [2018-11-14 16:44:53,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {24768#true} assume true; {24768#true} is VALID [2018-11-14 16:44:53,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24768#true} {24768#true} #388#return; {24768#true} is VALID [2018-11-14 16:44:53,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {24768#true} call #t~ret15 := main(); {24768#true} is VALID [2018-11-14 16:44:53,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {24768#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24768#true} is VALID [2018-11-14 16:44:53,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {24768#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~14 == 0bv32);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {24791#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {24791#(= (_ bv0 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~15 == 0bv32);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0bv32);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~18 == 0bv32);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {24804#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {24804#(= (_ bv1 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~19 == 0bv32);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;~main____CPAchecker_TMP_0~2 := #t~nondet7;havoc #t~nondet7; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~2 == 0bv32);havoc ~__tmp_21~0;~__tmp_21~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~20;~__VERIFIER_assert__cond~20 := ~__tmp_21~0; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~20 == 0bv32);havoc ~__tmp_22~0;~__tmp_22~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~21;~__VERIFIER_assert__cond~21 := ~__tmp_22~0; {24817#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {24817#(= (_ bv2 32) main_~main__t~0)} assume !(~__VERIFIER_assert__cond~21 == 0bv32);~main____CPAchecker_TMP_2~2 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~2;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~2; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {24830#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-14 16:44:53,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {24830#(= (_ bv3 32) main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 0bv32);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {24843#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:53,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {24843#(= (bvadd main_~__VERIFIER_assert__cond~12 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~12 == 0bv32; {24769#false} is VALID [2018-11-14 16:44:53,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {24769#false} assume !false; {24769#false} is VALID [2018-11-14 16:44:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:53,921 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:53,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:53,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:53,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:44:53,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:53,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:53,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:53,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:53,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:53,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:53,955 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 7 states. [2018-11-14 16:44:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:55,895 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-11-14 16:44:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:44:55,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-14 16:44:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-14 16:44:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2018-11-14 16:44:55,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 191 transitions. [2018-11-14 16:44:56,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:56,108 INFO L225 Difference]: With dead ends: 175 [2018-11-14 16:44:56,108 INFO L226 Difference]: Without dead ends: 173 [2018-11-14 16:44:56,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:44:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-14 16:44:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2018-11-14 16:44:56,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:56,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 158 states. [2018-11-14 16:44:56,129 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 158 states. [2018-11-14 16:44:56,129 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 158 states. [2018-11-14 16:44:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:56,132 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-14 16:44:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-14 16:44:56,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:56,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:56,133 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 173 states. [2018-11-14 16:44:56,133 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 173 states. [2018-11-14 16:44:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:56,135 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2018-11-14 16:44:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-14 16:44:56,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:56,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:56,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:56,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 16:44:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-11-14 16:44:56,138 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 25 [2018-11-14 16:44:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:56,138 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-11-14 16:44:56,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-11-14 16:44:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:44:56,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:56,138 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:56,139 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:56,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:56,139 INFO L82 PathProgramCache]: Analyzing trace with hash -920208099, now seen corresponding path program 1 times [2018-11-14 16:44:56,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:56,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 36 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 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:56,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:56,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:56,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {25562#true} call ULTIMATE.init(); {25562#true} is VALID [2018-11-14 16:44:56,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {25562#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {25562#true} is VALID [2018-11-14 16:44:56,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {25562#true} assume true; {25562#true} is VALID [2018-11-14 16:44:56,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25562#true} {25562#true} #388#return; {25562#true} is VALID [2018-11-14 16:44:56,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {25562#true} call #t~ret15 := main(); {25562#true} is VALID [2018-11-14 16:44:56,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {25562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {25562#true} is VALID [2018-11-14 16:44:56,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {25562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {25585#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-14 16:44:56,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {25585#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:56,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 16:44:56,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {25589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {25596#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} is VALID [2018-11-14 16:44:56,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {25596#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {25600#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(~main____CPAchecker_TMP_4~0 == 0bv32); {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-14 16:44:56,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {25607#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~__VERIFIER_assert__cond~11 == 0bv32);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:56,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:56,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:56,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:56,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:56,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {25623#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {25639#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:56,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {25639#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {25563#false} is VALID [2018-11-14 16:44:56,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {25563#false} assume !false; {25563#false} is VALID [2018-11-14 16:44:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:56,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:56,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {25563#false} assume !false; {25563#false} is VALID [2018-11-14 16:44:56,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {25649#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {25563#false} is VALID [2018-11-14 16:44:56,998 INFO L273 TraceCheckUtils]: 22: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {25649#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} is VALID [2018-11-14 16:44:56,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_4~0 == 0bv32);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:56,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:56,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:56,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~11 == 0bv32);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25653#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0bv32); {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_3~0 == 0bv32);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {25669#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-14 16:44:57,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:44:57,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {25692#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0);~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {25685#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-14 16:44:57,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {25692#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-14 16:44:57,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:57,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {25562#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {25696#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-14 16:44:57,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {25562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {25562#true} is VALID [2018-11-14 16:44:57,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {25562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {25562#true} is VALID [2018-11-14 16:44:57,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {25562#true} call #t~ret15 := main(); {25562#true} is VALID [2018-11-14 16:44:57,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25562#true} {25562#true} #388#return; {25562#true} is VALID [2018-11-14 16:44:57,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {25562#true} assume true; {25562#true} is VALID [2018-11-14 16:44:57,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {25562#true} ~__return_main~0 := 0bv32;~__return_2598~0 := 0bv32;~__tmp_2624_0~0 := 0bv32;~__tmp_2624_1~0 := 0bv32;~__tmp_3137_0~0 := 0bv32;~__tmp_3137_1~0 := 0bv32; {25562#true} is VALID [2018-11-14 16:44:57,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {25562#true} call ULTIMATE.init(); {25562#true} is VALID [2018-11-14 16:44:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:57,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:57,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-14 16:44:57,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-14 16:44:57,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:57,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:44:57,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:57,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:44:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:44:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:44:57,198 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states.