java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:32:43,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:43,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:43,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:43,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:43,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:43,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:43,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:43,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:43,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:43,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:43,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:43,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:43,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:43,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:43,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:43,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:43,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:43,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:43,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:43,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:43,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:43,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:43,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:43,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:43,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:43,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:43,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:43,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:43,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:43,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:43,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:43,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:43,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:43,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:43,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:43,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:43,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:43,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:43,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:43,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:43,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:32:43,110 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:43,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:43,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:43,111 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:43,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:43,113 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:43,113 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:43,113 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:43,114 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:43,114 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:43,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:43,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:43,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:43,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:43,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:43,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:43,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:43,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:43,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:43,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:43,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:43,118 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:43,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:43,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:43,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:43,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:43,119 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:43,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:43,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:43,120 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:43,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:43,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:43,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:43,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:43,187 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:43,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-03 02:32:43,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047b9172a/be3663c97c9a4142a3b963f44d7831ab/FLAG5708bb97a [2019-10-03 02:32:43,718 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:43,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-03 02:32:43,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047b9172a/be3663c97c9a4142a3b963f44d7831ab/FLAG5708bb97a [2019-10-03 02:32:44,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047b9172a/be3663c97c9a4142a3b963f44d7831ab [2019-10-03 02:32:44,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:44,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:44,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:44,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:44,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:44,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b22563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44, skipping insertion in model container [2019-10-03 02:32:44,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,138 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:44,189 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:44,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:44,566 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:44,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:44,675 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:44,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44 WrapperNode [2019-10-03 02:32:44,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:44,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:44,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:44,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:44,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... [2019-10-03 02:32:44,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:44,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:44,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:44,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:44,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:44,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:44,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:44,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:45,491 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:45,492 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:32:45,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:45 BoogieIcfgContainer [2019-10-03 02:32:45,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:45,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:45,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:45,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:45,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:44" (1/3) ... [2019-10-03 02:32:45,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c848ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:45, skipping insertion in model container [2019-10-03 02:32:45,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:44" (2/3) ... [2019-10-03 02:32:45,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c848ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:45, skipping insertion in model container [2019-10-03 02:32:45,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:45" (3/3) ... [2019-10-03 02:32:45,504 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-10-03 02:32:45,516 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:45,526 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-03 02:32:45,545 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-03 02:32:45,574 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:45,574 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:45,574 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:45,574 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:45,575 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:45,575 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:45,575 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:45,576 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-03 02:32:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-03 02:32:45,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:45,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:45,610 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-10-03 02:32:45,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:45,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:45,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:45,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:45,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:45,830 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-10-03 02:32:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,209 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2019-10-03 02:32:46,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:46,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-03 02:32:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,224 INFO L225 Difference]: With dead ends: 129 [2019-10-03 02:32:46,225 INFO L226 Difference]: Without dead ends: 118 [2019-10-03 02:32:46,227 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-03 02:32:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-03 02:32:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-03 02:32:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-10-03 02:32:46,275 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-10-03 02:32:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,276 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-10-03 02:32:46,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-10-03 02:32:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:32:46,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,278 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,278 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-10-03 02:32:46,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:46,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:46,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:46,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:46,363 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states. [2019-10-03 02:32:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,530 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-10-03 02:32:46,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:46,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-03 02:32:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,533 INFO L225 Difference]: With dead ends: 116 [2019-10-03 02:32:46,533 INFO L226 Difference]: Without dead ends: 113 [2019-10-03 02:32:46,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-03 02:32:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-03 02:32:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-03 02:32:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-10-03 02:32:46,546 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-10-03 02:32:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,547 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-10-03 02:32:46,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-10-03 02:32:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:32:46,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,549 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-10-03 02:32:46,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:46,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:46,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:46,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:46,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:46,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:46,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:46,632 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states. [2019-10-03 02:32:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,878 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-03 02:32:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:46,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-03 02:32:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,880 INFO L225 Difference]: With dead ends: 111 [2019-10-03 02:32:46,881 INFO L226 Difference]: Without dead ends: 111 [2019-10-03 02:32:46,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-03 02:32:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-03 02:32:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-03 02:32:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-10-03 02:32:46,902 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-10-03 02:32:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,905 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-10-03 02:32:46,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-10-03 02:32:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:46,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,909 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,912 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-10-03 02:32:46,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:46,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:46,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:46,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:46,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:46,996 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2019-10-03 02:32:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,148 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-10-03 02:32:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:47,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-03 02:32:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,150 INFO L225 Difference]: With dead ends: 109 [2019-10-03 02:32:47,150 INFO L226 Difference]: Without dead ends: 107 [2019-10-03 02:32:47,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-03 02:32:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-03 02:32:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-03 02:32:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-10-03 02:32:47,164 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-10-03 02:32:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,165 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-10-03 02:32:47,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-10-03 02:32:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:47,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,167 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-10-03 02:32:47,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,226 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states. [2019-10-03 02:32:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,471 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-10-03 02:32:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:47,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,474 INFO L225 Difference]: With dead ends: 123 [2019-10-03 02:32:47,474 INFO L226 Difference]: Without dead ends: 123 [2019-10-03 02:32:47,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-03 02:32:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-10-03 02:32:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-03 02:32:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-10-03 02:32:47,495 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-10-03 02:32:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,495 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-10-03 02:32:47,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-10-03 02:32:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:47,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,499 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-10-03 02:32:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,596 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states. [2019-10-03 02:32:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,787 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-10-03 02:32:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:47,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,790 INFO L225 Difference]: With dead ends: 103 [2019-10-03 02:32:47,790 INFO L226 Difference]: Without dead ends: 103 [2019-10-03 02:32:47,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-03 02:32:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-03 02:32:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-03 02:32:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-10-03 02:32:47,801 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-10-03 02:32:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,802 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-10-03 02:32:47,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-10-03 02:32:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:47,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,809 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-10-03 02:32:47,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,922 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-10-03 02:32:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:48,175 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-10-03 02:32:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:48,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,177 INFO L225 Difference]: With dead ends: 118 [2019-10-03 02:32:48,177 INFO L226 Difference]: Without dead ends: 118 [2019-10-03 02:32:48,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-03 02:32:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-10-03 02:32:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-03 02:32:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-10-03 02:32:48,184 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-10-03 02:32:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:48,184 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-10-03 02:32:48,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-10-03 02:32:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:48,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:48,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:48,186 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-10-03 02:32:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:48,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:48,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:48,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:48,254 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2019-10-03 02:32:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:48,476 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-10-03 02:32:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:48,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,478 INFO L225 Difference]: With dead ends: 118 [2019-10-03 02:32:48,478 INFO L226 Difference]: Without dead ends: 118 [2019-10-03 02:32:48,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-03 02:32:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-10-03 02:32:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-03 02:32:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-03 02:32:48,483 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-10-03 02:32:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:48,483 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-03 02:32:48,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-03 02:32:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:48,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:48,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:48,485 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:48,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-10-03 02:32:48,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:48,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:48,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:48,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:48,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:48,596 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-10-03 02:32:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:48,818 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-10-03 02:32:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:48,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,823 INFO L225 Difference]: With dead ends: 97 [2019-10-03 02:32:48,823 INFO L226 Difference]: Without dead ends: 95 [2019-10-03 02:32:48,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-03 02:32:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-03 02:32:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-03 02:32:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-10-03 02:32:48,828 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-10-03 02:32:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:48,828 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-10-03 02:32:48,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-10-03 02:32:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:32:48,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:48,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:48,830 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-10-03 02:32:48,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:48,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:48,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:48,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:48,909 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-10-03 02:32:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:49,188 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-10-03 02:32:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:49,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-03 02:32:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:49,190 INFO L225 Difference]: With dead ends: 109 [2019-10-03 02:32:49,190 INFO L226 Difference]: Without dead ends: 109 [2019-10-03 02:32:49,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-03 02:32:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-10-03 02:32:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-03 02:32:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-10-03 02:32:49,195 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-10-03 02:32:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:49,195 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-10-03 02:32:49,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-10-03 02:32:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:49,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:49,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:49,197 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-10-03 02:32:49,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:49,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:49,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:49,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:49,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:49,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:49,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:49,242 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 6 states. [2019-10-03 02:32:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:49,455 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-10-03 02:32:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:49,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-03 02:32:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:49,457 INFO L225 Difference]: With dead ends: 101 [2019-10-03 02:32:49,457 INFO L226 Difference]: Without dead ends: 101 [2019-10-03 02:32:49,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-03 02:32:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-10-03 02:32:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-03 02:32:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-10-03 02:32:49,461 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-10-03 02:32:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:49,462 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-10-03 02:32:49,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-10-03 02:32:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:32:49,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:49,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:49,463 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-10-03 02:32:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:49,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:49,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:49,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:49,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:49,494 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states. [2019-10-03 02:32:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:49,606 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-03 02:32:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:49,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-03 02:32:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:49,608 INFO L225 Difference]: With dead ends: 89 [2019-10-03 02:32:49,608 INFO L226 Difference]: Without dead ends: 58 [2019-10-03 02:32:49,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-03 02:32:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-03 02:32:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-03 02:32:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-10-03 02:32:49,614 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-10-03 02:32:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:49,614 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-10-03 02:32:49,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-10-03 02:32:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 02:32:49,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:49,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:49,619 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-10-03 02:32:49,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:32:49,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:49,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:32:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:32:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:32:49,841 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2019-10-03 02:32:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:49,971 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-10-03 02:32:49,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:32:49,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-10-03 02:32:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:49,995 INFO L225 Difference]: With dead ends: 65 [2019-10-03 02:32:49,997 INFO L226 Difference]: Without dead ends: 65 [2019-10-03 02:32:49,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-03 02:32:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-10-03 02:32:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-03 02:32:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-10-03 02:32:50,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-10-03 02:32:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:50,001 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-10-03 02:32:50,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:32:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-10-03 02:32:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 02:32:50,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,010 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-10-03 02:32:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:32:50,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:32:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:32:50,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:32:50,221 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-10-03 02:32:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:50,358 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-10-03 02:32:50,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:32:50,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-10-03 02:32:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:50,360 INFO L225 Difference]: With dead ends: 54 [2019-10-03 02:32:50,360 INFO L226 Difference]: Without dead ends: 54 [2019-10-03 02:32:50,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-03 02:32:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-03 02:32:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-03 02:32:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-10-03 02:32:50,365 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-10-03 02:32:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:50,365 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-10-03 02:32:50,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:32:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-10-03 02:32:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:32:50,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,367 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-10-03 02:32:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:50,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:50,637 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2019-10-03 02:32:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:50,765 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-10-03 02:32:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:50,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-03 02:32:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:50,766 INFO L225 Difference]: With dead ends: 60 [2019-10-03 02:32:50,766 INFO L226 Difference]: Without dead ends: 60 [2019-10-03 02:32:50,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-03 02:32:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-03 02:32:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-03 02:32:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-10-03 02:32:50,769 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-10-03 02:32:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:50,769 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-10-03 02:32:50,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-10-03 02:32:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:32:50,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,771 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-10-03 02:32:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:50,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:50,955 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-10-03 02:32:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,043 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-03 02:32:51,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:51,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-03 02:32:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,044 INFO L225 Difference]: With dead ends: 50 [2019-10-03 02:32:51,044 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:32:51,044 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:32:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:32:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:32:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:32:51,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-10-03 02:32:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,045 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:32:51,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:32:51,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:32:51,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:32:51 BoogieIcfgContainer [2019-10-03 02:32:51,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:32:51,054 INFO L168 Benchmark]: Toolchain (without parser) took 6934.68 ms. Allocated memory was 132.6 MB in the beginning and 319.3 MB in the end (delta: 186.6 MB). Free memory was 88.0 MB in the beginning and 140.9 MB in the end (delta: -52.9 MB). Peak memory consumption was 133.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:51,055 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:32:51,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.67 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 87.8 MB in the beginning and 171.8 MB in the end (delta: -84.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:51,057 INFO L168 Benchmark]: Boogie Preprocessor took 67.34 ms. Allocated memory is still 199.8 MB. Free memory was 171.8 MB in the beginning and 168.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:51,057 INFO L168 Benchmark]: RCFGBuilder took 749.74 ms. Allocated memory is still 199.8 MB. Free memory was 168.9 MB in the beginning and 119.3 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:51,058 INFO L168 Benchmark]: TraceAbstraction took 5556.13 ms. Allocated memory was 199.8 MB in the beginning and 319.3 MB in the end (delta: 119.5 MB). Free memory was 119.3 MB in the beginning and 140.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:51,062 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 552.67 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 87.8 MB in the beginning and 171.8 MB in the end (delta: -84.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.34 ms. Allocated memory is still 199.8 MB. Free memory was 171.8 MB in the beginning and 168.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 749.74 ms. Allocated memory is still 199.8 MB. Free memory was 168.9 MB in the beginning and 119.3 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5556.13 ms. Allocated memory was 199.8 MB in the beginning and 319.3 MB in the end (delta: 119.5 MB). Free memory was 119.3 MB in the beginning and 140.9 MB in the end (delta: -21.6 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 5.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 766 SDtfs, 1971 SDslu, 883 SDs, 0 SdLazy, 2383 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 39 SyntacticMatches, 57 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 44972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...