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-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:01:04,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:04,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:01:04,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:01:04,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:01:04,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:01:04,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:04,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:04,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:04,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:04,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:04,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:04,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:04,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:04,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:04,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:04,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:04,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:04,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:04,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:04,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:04,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:04,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:04,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:04,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:04,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:04,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:04,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:04,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:04,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:04,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:04,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:04,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:04,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:04,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:04,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:04,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:04,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:04,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:04,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:04,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:04,198 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-09-05 13:01:04,212 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:04,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:04,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:04,213 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:04,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:04,213 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:04,214 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:04,214 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:04,214 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:04,214 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:04,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:04,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:04,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:04,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:04,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:04,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:04,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:04,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:04,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:04,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:04,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:04,217 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:04,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:04,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:04,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:04,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:04,218 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:04,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:04,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:04,218 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:04,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:04,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:04,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:04,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:04,260 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:04,261 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-09-05 13:01:04,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7253162/a07338809e9741689a97803c533bcef1/FLAG06867a785 [2019-09-05 13:01:04,793 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:04,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-09-05 13:01:04,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7253162/a07338809e9741689a97803c533bcef1/FLAG06867a785 [2019-09-05 13:01:05,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7253162/a07338809e9741689a97803c533bcef1 [2019-09-05 13:01:05,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:05,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:05,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:05,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:05,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:05,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da9771c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05, skipping insertion in model container [2019-09-05 13:01:05,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,167 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:05,211 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:05,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:05,439 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:05,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:05,582 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:05,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05 WrapperNode [2019-09-05 13:01:05,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:05,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:05,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:05,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:05,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (1/1) ... [2019-09-05 13:01:05,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:05,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:05,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:05,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:05,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (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-09-05 13:01:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:05,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:06,076 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:06,077 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:01:06,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:06 BoogieIcfgContainer [2019-09-05 13:01:06,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:06,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:06,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:06,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:06,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:01:05" (1/3) ... [2019-09-05 13:01:06,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513015da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:06, skipping insertion in model container [2019-09-05 13:01:06,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:05" (2/3) ... [2019-09-05 13:01:06,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513015da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:06, skipping insertion in model container [2019-09-05 13:01:06,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:06" (3/3) ... [2019-09-05 13:01:06,085 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-09-05 13:01:06,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:06,102 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-05 13:01:06,117 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-05 13:01:06,142 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:06,142 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:06,142 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:06,142 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:06,142 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:06,143 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:06,143 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:06,143 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-09-05 13:01:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:01:06,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:06,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:06,174 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-09-05 13:01:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:01:06,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:06,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:01:06,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:01:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:01:06,364 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-09-05 13:01:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:06,398 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2019-09-05 13:01:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:01:06,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-05 13:01:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:06,410 INFO L225 Difference]: With dead ends: 87 [2019-09-05 13:01:06,410 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 13:01:06,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:01:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 13:01:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-05 13:01:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 13:01:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-09-05 13:01:06,455 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-09-05 13:01:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:06,455 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-09-05 13:01:06,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:01:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-09-05 13:01:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:01:06,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:06,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:06,464 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-09-05 13:01:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:06,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:06,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:06,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:06,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:06,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:06,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:06,595 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-09-05 13:01:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:06,720 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-09-05 13:01:06,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:06,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-05 13:01:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:06,722 INFO L225 Difference]: With dead ends: 78 [2019-09-05 13:01:06,723 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 13:01:06,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 13:01:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-05 13:01:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 13:01:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-05 13:01:06,732 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-09-05 13:01:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:06,732 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-05 13:01:06,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-05 13:01:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:01:06,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:06,734 INFO L399 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] [2019-09-05 13:01:06,734 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-09-05 13:01:06,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:06,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:06,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:06,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:06,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:06,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:06,795 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-09-05 13:01:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:06,910 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-09-05 13:01:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:06,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-05 13:01:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:06,914 INFO L225 Difference]: With dead ends: 99 [2019-09-05 13:01:06,915 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 13:01:06,915 INFO L628 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-09-05 13:01:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 13:01:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-09-05 13:01:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 13:01:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-05 13:01:06,924 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-09-05 13:01:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:06,925 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-05 13:01:06,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-05 13:01:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 13:01:06,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:06,926 INFO L399 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] [2019-09-05 13:01:06,927 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-09-05 13:01:06,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:06,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:07,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:07,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:07,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:07,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:07,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:07,016 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-09-05 13:01:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:07,097 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-09-05 13:01:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:07,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-05 13:01:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:07,099 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:01:07,099 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 13:01:07,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 13:01:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-05 13:01:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 13:01:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-09-05 13:01:07,106 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-09-05 13:01:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:07,106 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-09-05 13:01:07,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-09-05 13:01:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 13:01:07,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:07,108 INFO L399 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] [2019-09-05 13:01:07,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-09-05 13:01:07,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:07,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:07,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:07,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:07,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:07,189 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-09-05 13:01:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:07,332 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-09-05 13:01:07,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:07,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-05 13:01:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:07,335 INFO L225 Difference]: With dead ends: 139 [2019-09-05 13:01:07,335 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 13:01:07,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 13:01:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-09-05 13:01:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 13:01:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-05 13:01:07,342 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-09-05 13:01:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:07,343 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-05 13:01:07,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-05 13:01:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 13:01:07,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:07,344 INFO L399 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] [2019-09-05 13:01:07,345 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-09-05 13:01:07,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:07,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:07,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:07,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:07,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:07,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:07,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:07,408 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-05 13:01:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:07,550 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2019-09-05 13:01:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:07,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-05 13:01:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:07,552 INFO L225 Difference]: With dead ends: 106 [2019-09-05 13:01:07,553 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 13:01:07,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 13:01:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-09-05 13:01:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 13:01:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-09-05 13:01:07,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-09-05 13:01:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:07,559 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-09-05 13:01:07,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-09-05 13:01:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:01:07,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:07,562 INFO L399 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] [2019-09-05 13:01:07,563 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:07,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-09-05 13:01:07,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:07,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:07,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:07,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:07,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:07,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:07,653 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-09-05 13:01:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:07,774 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-09-05 13:01:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:07,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 13:01:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:07,775 INFO L225 Difference]: With dead ends: 119 [2019-09-05 13:01:07,775 INFO L226 Difference]: Without dead ends: 119 [2019-09-05 13:01:07,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-05 13:01:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-09-05 13:01:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 13:01:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-05 13:01:07,781 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-09-05 13:01:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:07,782 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-05 13:01:07,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-05 13:01:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:01:07,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:07,783 INFO L399 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] [2019-09-05 13:01:07,783 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-09-05 13:01:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:07,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:07,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:07,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:07,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:07,836 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-05 13:01:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:07,924 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-05 13:01:07,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:07,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 13:01:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:07,927 INFO L225 Difference]: With dead ends: 75 [2019-09-05 13:01:07,927 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 13:01:07,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 13:01:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-05 13:01:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 13:01:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-09-05 13:01:07,931 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-09-05 13:01:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:07,932 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-09-05 13:01:07,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-09-05 13:01:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 13:01:07,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:07,933 INFO L399 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] [2019-09-05 13:01:07,934 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:07,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-09-05 13:01:07,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:07,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:01:07,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:07,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:01:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:01:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:01:07,965 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-09-05 13:01:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:08,007 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-09-05 13:01:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:01:08,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-05 13:01:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:08,008 INFO L225 Difference]: With dead ends: 79 [2019-09-05 13:01:08,008 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 13:01:08,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:01:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 13:01:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-05 13:01:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 13:01:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-09-05 13:01:08,013 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-09-05 13:01:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:08,013 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-09-05 13:01:08,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:01:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-09-05 13:01:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:01:08,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:08,015 INFO L399 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] [2019-09-05 13:01:08,016 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:08,016 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-09-05 13:01:08,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:08,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:08,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:08,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:08,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:08,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:08,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:08,090 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-09-05 13:01:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:08,175 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-09-05 13:01:08,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:08,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-05 13:01:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:08,176 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:01:08,177 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 13:01:08,177 INFO L628 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-09-05 13:01:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 13:01:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-05 13:01:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 13:01:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-09-05 13:01:08,185 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-09-05 13:01:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:08,185 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-09-05 13:01:08,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-09-05 13:01:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:01:08,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:08,189 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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-09-05 13:01:08,192 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-09-05 13:01:08,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:08,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:01:08,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:08,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:08,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-09-05 13:01:08,321 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [192], [195], [196], [198], [204], [214], [215], [216] [2019-09-05 13:01:08,367 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:01:08,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:01:08,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:01:08,571 INFO L272 AbstractInterpreter]: Visited 28 different actions 64 times. Merged at 6 different actions 36 times. Widened at 1 different actions 2 times. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2019-09-05 13:01:08,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:08,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:01:08,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:08,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:08,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:08,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:01:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:08,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:01:08,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:08,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:01:08,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:01:08,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:08,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-09-05 13:01:08,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:08,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:01:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:01:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:01:08,758 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 8 states. [2019-09-05 13:01:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:08,890 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-09-05 13:01:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:08,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-09-05 13:01:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:08,892 INFO L225 Difference]: With dead ends: 109 [2019-09-05 13:01:08,892 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 13:01:08,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:01:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 13:01:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-09-05 13:01:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 13:01:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-09-05 13:01:08,895 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-09-05 13:01:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:08,896 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-09-05 13:01:08,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:01:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-09-05 13:01:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:01:08,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:08,897 INFO L399 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] [2019-09-05 13:01:08,898 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-09-05 13:01:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:08,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:08,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:08,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:08,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:08,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:08,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:08,935 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-09-05 13:01:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:08,999 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-09-05 13:01:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:09,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-05 13:01:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,001 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:01:09,001 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 13:01:09,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 13:01:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-05 13:01:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 13:01:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-05 13:01:09,004 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-09-05 13:01:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,004 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-05 13:01:09,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-05 13:01:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:01:09,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,005 INFO L399 BasicCegarLoop]: trace histogram [2, 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-09-05 13:01:09,006 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-09-05 13:01:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:01:09,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:09,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:09,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-05 13:01:09,081 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [85], [86], [192], [198], [204], [214], [215], [216] [2019-09-05 13:01:09,086 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:01:09,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:01:09,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:01:09,208 INFO L272 AbstractInterpreter]: Visited 30 different actions 75 times. Merged at 8 different actions 44 times. Widened at 2 different actions 3 times. Performed 320 root evaluator evaluations with a maximum evaluation depth of 4. Performed 320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2019-09-05 13:01:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:01:09,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:09,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:01:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:01:09,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:01:09,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:01:09,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:09,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-09-05 13:01:09,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:09,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:01:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:01:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:01:09,331 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-09-05 13:01:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,422 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-09-05 13:01:09,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:09,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-05 13:01:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,423 INFO L225 Difference]: With dead ends: 67 [2019-09-05 13:01:09,424 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 13:01:09,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:01:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 13:01:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-09-05 13:01:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 13:01:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-05 13:01:09,427 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-09-05 13:01:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,427 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-05 13:01:09,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:01:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-05 13:01:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:01:09,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,429 INFO L399 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] [2019-09-05 13:01:09,429 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-09-05 13:01:09,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:09,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:09,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:09,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:09,517 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-09-05 13:01:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,580 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-05 13:01:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:09,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-09-05 13:01:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,581 INFO L225 Difference]: With dead ends: 61 [2019-09-05 13:01:09,581 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 13:01:09,582 INFO L628 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-09-05 13:01:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 13:01:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-05 13:01:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 13:01:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-05 13:01:09,584 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-05 13:01:09,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,584 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-05 13:01:09,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-05 13:01:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 13:01:09,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,585 INFO L399 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] [2019-09-05 13:01:09,586 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-09-05 13:01:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:09,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 13:01:09,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:01:09,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:01:09,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:09,664 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-09-05 13:01:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,752 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-09-05 13:01:09,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:09,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-09-05 13:01:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,753 INFO L225 Difference]: With dead ends: 69 [2019-09-05 13:01:09,753 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 13:01:09,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:01:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 13:01:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-09-05 13:01:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 13:01:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-05 13:01:09,756 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-09-05 13:01:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,757 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-05 13:01:09,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:01:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-05 13:01:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:01:09,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,758 INFO L399 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] [2019-09-05 13:01:09,758 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-09-05 13:01:09,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:09,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:09,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:09,807 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-09-05 13:01:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,917 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-09-05 13:01:09,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:09,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-05 13:01:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,918 INFO L225 Difference]: With dead ends: 89 [2019-09-05 13:01:09,918 INFO L226 Difference]: Without dead ends: 89 [2019-09-05 13:01:09,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-05 13:01:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-09-05 13:01:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 13:01:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-05 13:01:09,921 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-09-05 13:01:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,921 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-05 13:01:09,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-05 13:01:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 13:01:09,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,923 INFO L399 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] [2019-09-05 13:01:09,923 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-09-05 13:01:09,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:09,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:09,974 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-09-05 13:01:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,045 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-05 13:01:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:10,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-05 13:01:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,047 INFO L225 Difference]: With dead ends: 59 [2019-09-05 13:01:10,047 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 13:01:10,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 13:01:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-05 13:01:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 13:01:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-05 13:01:10,050 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-09-05 13:01:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,051 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-05 13:01:10,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-05 13:01:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 13:01:10,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,052 INFO L399 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] [2019-09-05 13:01:10,053 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-09-05 13:01:10,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,106 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-09-05 13:01:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,123 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-09-05 13:01:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:10,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-09-05 13:01:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,124 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:01:10,124 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 13:01:10,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 13:01:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-05 13:01:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 13:01:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-05 13:01:10,127 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-09-05 13:01:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,127 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-05 13:01:10,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-05 13:01:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:01:10,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,128 INFO L399 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] [2019-09-05 13:01:10,129 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-09-05 13:01:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,180 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-05 13:01:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,205 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-09-05 13:01:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:10,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-05 13:01:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,206 INFO L225 Difference]: With dead ends: 66 [2019-09-05 13:01:10,206 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 13:01:10,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 13:01:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-05 13:01:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 13:01:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-05 13:01:10,209 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-09-05 13:01:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,209 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-05 13:01:10,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-05 13:01:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 13:01:10,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,210 INFO L399 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] [2019-09-05 13:01:10,210 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-09-05 13:01:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,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-09-05 13:01:10,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,255 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-09-05 13:01:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,359 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-09-05 13:01:10,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:10,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-05 13:01:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,360 INFO L225 Difference]: With dead ends: 88 [2019-09-05 13:01:10,360 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 13:01:10,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 13:01:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-09-05 13:01:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 13:01:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-05 13:01:10,363 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-09-05 13:01:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,363 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-05 13:01:10,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-05 13:01:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 13:01:10,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,365 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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-09-05 13:01:10,365 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-09-05 13:01:10,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:10,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:10,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2019-09-05 13:01:10,481 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [88], [94], [100], [106], [112], [117], [120], [126], [132], [136], [139], [142], [143], [145], [151], [180], [182], [214], [215], [216] [2019-09-05 13:01:10,488 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:01:10,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:01:10,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:01:10,613 INFO L272 AbstractInterpreter]: Visited 42 different actions 89 times. Merged at 8 different actions 47 times. Widened at 2 different actions 3 times. Performed 362 root evaluator evaluations with a maximum evaluation depth of 4. Performed 362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2019-09-05 13:01:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:01:10,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:10,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:10,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:01:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:01:10,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:10,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:10,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:10,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-09-05 13:01:10,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:10,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:01:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:01:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:01:10,762 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2019-09-05 13:01:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,884 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-09-05 13:01:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:01:10,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-05 13:01:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,885 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:01:10,885 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 13:01:10,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:01:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 13:01:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-05 13:01:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 13:01:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-05 13:01:10,888 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-09-05 13:01:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,888 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-05 13:01:10,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:01:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-05 13:01:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 13:01:10,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,889 INFO L399 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] [2019-09-05 13:01:10,889 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-09-05 13:01:10,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,934 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-05 13:01:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,008 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-05 13:01:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-05 13:01:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,011 INFO L225 Difference]: With dead ends: 69 [2019-09-05 13:01:11,011 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 13:01:11,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 13:01:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-05 13:01:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 13:01:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-05 13:01:11,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-09-05 13:01:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,014 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-05 13:01:11,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-05 13:01:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 13:01:11,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,015 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-09-05 13:01:11,016 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-09-05 13:01:11,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:01:11,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,065 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-05 13:01:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,189 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-05 13:01:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:01:11,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-05 13:01:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,190 INFO L225 Difference]: With dead ends: 75 [2019-09-05 13:01:11,190 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 13:01:11,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 13:01:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-09-05 13:01:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 13:01:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-09-05 13:01:11,193 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-09-05 13:01:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,193 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-09-05 13:01:11,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-09-05 13:01:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 13:01:11,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,194 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-09-05 13:01:11,194 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-09-05 13:01:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:11,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:11,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2019-09-05 13:01:11,232 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [88], [94], [100], [106], [112], [117], [120], [126], [132], [136], [139], [145], [151], [154], [157], [158], [160], [166], [172], [178], [180], [214], [215], [216] [2019-09-05 13:01:11,235 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:01:11,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:01:11,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:01:11,363 INFO L272 AbstractInterpreter]: Visited 46 different actions 117 times. Merged at 12 different actions 71 times. Widened at 2 different actions 3 times. Performed 670 root evaluator evaluations with a maximum evaluation depth of 4. Performed 670 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 52 variables. [2019-09-05 13:01:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:01:11,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:11,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:01:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:01:11,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:11,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:01:11,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:01:11,479 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:01:11,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 6 [2019-09-05 13:01:11,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:11,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:11,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:11,480 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2019-09-05 13:01:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,515 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-09-05 13:01:11,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-05 13:01:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,516 INFO L225 Difference]: With dead ends: 58 [2019-09-05 13:01:11,516 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:11,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:11,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-09-05 13:01:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,517 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:11,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:11,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:11,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:11 BoogieIcfgContainer [2019-09-05 13:01:11,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:11,525 INFO L168 Benchmark]: Toolchain (without parser) took 6372.40 ms. Allocated memory was 132.6 MB in the beginning and 315.6 MB in the end (delta: 183.0 MB). Free memory was 88.1 MB in the beginning and 283.7 MB in the end (delta: -195.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 13:01:11,525 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 13:01:11,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.00 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 88.1 MB in the beginning and 176.8 MB in the end (delta: -88.7 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:11,527 INFO L168 Benchmark]: Boogie Preprocessor took 36.11 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 175.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:11,528 INFO L168 Benchmark]: RCFGBuilder took 458.03 ms. Allocated memory is still 200.3 MB. Free memory was 175.0 MB in the beginning and 148.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:11,528 INFO L168 Benchmark]: TraceAbstraction took 5443.70 ms. Allocated memory was 200.3 MB in the beginning and 315.6 MB in the end (delta: 115.3 MB). Free memory was 147.9 MB in the beginning and 283.7 MB in the end (delta: -135.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 13:01:11,531 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.20 ms. Allocated memory is still 132.6 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 431.00 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 88.1 MB in the beginning and 176.8 MB in the end (delta: -88.7 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.11 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 175.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 458.03 ms. Allocated memory is still 200.3 MB. Free memory was 175.0 MB in the beginning and 148.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5443.70 ms. Allocated memory was 200.3 MB in the beginning and 315.6 MB in the end (delta: 115.3 MB). Free memory was 147.9 MB in the beginning and 283.7 MB in the end (delta: -135.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 267]: 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: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: 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: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 5.3s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1400 SDtfs, 2401 SDslu, 1855 SDs, 0 SdLazy, 1180 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 339 SyntacticMatches, 22 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1081 ConstructedInterpolants, 0 QuantifiedInterpolants, 100107 SizeOfPredicates, 33 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 24/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...