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-c6af20d [2019-09-03 20:51:51,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:51,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:51,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:51,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:51,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:51,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:51,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:51,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:51,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:51,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:51,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:51,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:51,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:51,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:51,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:51,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:51,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:51,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:51,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:51,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:51,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:51,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:51,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:51,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:51,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:51,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:51,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:51,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:51,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:51,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:51,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:51,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:51,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:51,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:51,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:51,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:51,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:51,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:51,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:51,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:51,630 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-03 20:51:51,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:51,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:51,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:51,646 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:51,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:51,647 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:51,647 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:51,647 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:51,647 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:51,647 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:51,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:51,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:51,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:51,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:51,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:51,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:51,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:51,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:51,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:51,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:51,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:51,650 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:51,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:51,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:51,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:51,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:51,651 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:51,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:51,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:51,652 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:51,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:51,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:51,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:51,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:51,696 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:51,696 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-03 20:51:51,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc60006e/051312aef62046c1914b4d84dea7326b/FLAG76a882192 [2019-09-03 20:51:52,202 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:52,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-09-03 20:51:52,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc60006e/051312aef62046c1914b4d84dea7326b/FLAG76a882192 [2019-09-03 20:51:52,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc60006e/051312aef62046c1914b4d84dea7326b [2019-09-03 20:51:52,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:52,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:52,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:52,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:52,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:52,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:52" (1/1) ... [2019-09-03 20:51:52,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2088cf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:52, skipping insertion in model container [2019-09-03 20:51:52,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:52" (1/1) ... [2019-09-03 20:51:52,603 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:52,657 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:52,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:52,904 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:53,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:53,050 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:53,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53 WrapperNode [2019-09-03 20:51:53,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:53,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:53,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:53,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:53,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:53,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:53,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:53,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:53,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (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-03 20:51:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:53,632 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:53,632 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:53,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:53 BoogieIcfgContainer [2019-09-03 20:51:53,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:53,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:53,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:53,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:53,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:52" (1/3) ... [2019-09-03 20:51:53,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdd29c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:53, skipping insertion in model container [2019-09-03 20:51:53,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53" (2/3) ... [2019-09-03 20:51:53,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdd29c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:53, skipping insertion in model container [2019-09-03 20:51:53,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:53" (3/3) ... [2019-09-03 20:51:53,644 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-09-03 20:51:53,654 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:53,665 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-03 20:51:53,681 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-03 20:51:53,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:53,724 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:53,725 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:53,725 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:53,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:53,725 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:53,725 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:53,725 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-09-03 20:51:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:51:53,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:53,763 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-03 20:51:53,766 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-09-03 20:51:53,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:53,943 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-03 20:51:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:53,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:53,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:53,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:53,965 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-09-03 20:51:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,999 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2019-09-03 20:51:53,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:54,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-03 20:51:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:54,011 INFO L225 Difference]: With dead ends: 87 [2019-09-03 20:51:54,012 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:51:54,014 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-03 20:51:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:51:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 20:51:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:51:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-09-03 20:51:54,057 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-09-03 20:51:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:54,058 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-09-03 20:51:54,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-09-03 20:51:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:51:54,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:54,060 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-03 20:51:54,061 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-09-03 20:51:54,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:54,174 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-03 20:51:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:54,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:54,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:54,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:54,177 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-09-03 20:51:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:54,274 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-09-03 20:51:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:54,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-03 20:51:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:54,276 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:51:54,276 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:51:54,277 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-03 20:51:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:51:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-03 20:51:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 20:51:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-03 20:51:54,286 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-09-03 20:51:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:54,286 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-03 20:51:54,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-03 20:51:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:51:54,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:54,288 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-03 20:51:54,288 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-09-03 20:51:54,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:54,349 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-03 20:51:54,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:54,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:54,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:54,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:54,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:54,351 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-09-03 20:51:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:54,470 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-09-03 20:51:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:54,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-03 20:51:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:54,472 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:51:54,472 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:51:54,473 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-03 20:51:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:51:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-09-03 20:51:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:51:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-03 20:51:54,481 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-09-03 20:51:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:54,481 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-03 20:51:54,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-03 20:51:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:51:54,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:54,483 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-03 20:51:54,484 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-09-03 20:51:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:54,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:54,541 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-03 20:51:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:54,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:54,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:54,543 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-09-03 20:51:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:54,623 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-09-03 20:51:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:54,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-03 20:51:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:54,625 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:51:54,625 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:51:54,625 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-03 20:51:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:51:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-03 20:51:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:51:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-09-03 20:51:54,631 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-09-03 20:51:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:54,632 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-09-03 20:51:54,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-09-03 20:51:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:51:54,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:54,633 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-03 20:51:54,634 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-09-03 20:51:54,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:54,724 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-03 20:51:54,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:54,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:54,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:54,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:54,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:54,727 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-09-03 20:51:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:54,903 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-09-03 20:51:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:54,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-03 20:51:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:54,906 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:51:54,907 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 20:51:54,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:51:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 20:51:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-09-03 20:51:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:51:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-03 20:51:54,921 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-09-03 20:51:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:54,925 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-03 20:51:54,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-03 20:51:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:51:54,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:54,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, 1, 1, 1] [2019-09-03 20:51:54,927 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-09-03 20:51:54,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:54,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:54,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,003 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-03 20:51:55,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:55,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:55,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:55,006 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-03 20:51:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,149 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2019-09-03 20:51:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:55,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-03 20:51:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,151 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:51:55,151 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:51:55,152 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-03 20:51:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:51:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-09-03 20:51:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:51:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-09-03 20:51:55,158 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-09-03 20:51:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,158 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-09-03 20:51:55,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-09-03 20:51:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:51:55,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,159 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-03 20:51:55,160 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-09-03 20:51:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,213 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-03 20:51:55,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:55,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:55,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:55,215 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-09-03 20:51:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,326 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-09-03 20:51:55,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:55,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-03 20:51:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,328 INFO L225 Difference]: With dead ends: 119 [2019-09-03 20:51:55,328 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 20:51:55,329 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-03 20:51:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 20:51:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-09-03 20:51:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:51:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-03 20:51:55,334 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-09-03 20:51:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,335 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-03 20:51:55,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-03 20:51:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:51:55,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,336 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-03 20:51:55,337 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-09-03 20:51:55,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,385 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-03 20:51:55,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:55,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:55,388 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-03 20:51:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,477 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-03 20:51:55,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:55,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-03 20:51:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,478 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:51:55,478 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:51:55,479 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-03 20:51:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:51:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-03 20:51:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:51:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-09-03 20:51:55,486 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-09-03 20:51:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,486 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-09-03 20:51:55,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-09-03 20:51:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:51:55,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,488 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-03 20:51:55,489 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-09-03 20:51:55,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,554 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-03 20:51:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:55,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:55,556 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-09-03 20:51:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,594 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-09-03 20:51:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:55,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-03 20:51:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,595 INFO L225 Difference]: With dead ends: 79 [2019-09-03 20:51:55,596 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:51:55,596 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-03 20:51:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:51:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-03 20:51:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:51:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-09-03 20:51:55,602 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-09-03 20:51:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,610 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-09-03 20:51:55,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-09-03 20:51:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:51:55,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,611 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-03 20:51:55,612 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-09-03 20:51:55,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,710 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-03 20:51:55,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:55,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:55,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:55,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:55,713 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-09-03 20:51:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,798 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-09-03 20:51:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:55,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-03 20:51:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,800 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:51:55,800 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:51:55,800 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-03 20:51:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:51:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 20:51:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:51:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-09-03 20:51:55,818 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-09-03 20:51:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,819 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-09-03 20:51:55,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-09-03 20:51:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:51:55,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,820 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-03 20:51:55,823 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-09-03 20:51:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,928 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-03 20:51:55,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:55,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:55,930 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-09-03 20:51:55,931 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-03 20:51:55,974 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:51:55,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:51:56,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:51:56,237 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-03 20:51:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:51:56,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:56,245 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-03 20:51:56,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:51:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:51:56,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:56,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:51:56,355 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-03 20:51:56,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:56,403 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-03 20:51:56,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:56,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-09-03 20:51:56,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:56,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:51:56,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:51:56,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:51:56,409 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 8 states. [2019-09-03 20:51:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:56,573 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-09-03 20:51:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:56,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-09-03 20:51:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:56,574 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:51:56,575 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:51:56,575 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-03 20:51:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:51:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-09-03 20:51:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:51:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-09-03 20:51:56,585 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-09-03 20:51:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:56,586 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-09-03 20:51:56,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:51:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-09-03 20:51:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:51:56,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:56,587 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-03 20:51:56,587 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-09-03 20:51:56,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,646 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-03 20:51:56,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:56,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:56,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:56,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:56,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:56,648 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-09-03 20:51:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:56,712 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-09-03 20:51:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:56,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-03 20:51:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:56,713 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:51:56,713 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:51:56,714 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-03 20:51:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:51:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-03 20:51:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:51:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-03 20:51:56,716 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-09-03 20:51:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:56,717 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-03 20:51:56,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-03 20:51:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:51:56,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:56,718 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-03 20:51:56,719 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-09-03 20:51:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,808 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-03 20:51:56,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:56,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:56,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-03 20:51:56,809 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-03 20:51:56,814 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:51:56,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:51:56,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:51:56,934 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-03 20:51:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:51:56,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:56,935 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-03 20:51:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:51:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:51:56,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:57,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:51:57,016 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-03 20:51:57,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:57,047 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-03 20:51:57,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:57,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-09-03 20:51:57,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:57,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:51:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:51:57,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:51:57,052 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-09-03 20:51:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,173 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-09-03 20:51:57,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:57,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-03 20:51:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,175 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:51:57,175 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:51:57,176 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-03 20:51:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:51:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-09-03 20:51:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:51:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-03 20:51:57,179 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-09-03 20:51:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,179 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-03 20:51:57,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:51:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-03 20:51:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:51:57,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,181 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-03 20:51:57,181 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-09-03 20:51:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,228 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-03 20:51:57,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,230 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-09-03 20:51:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,299 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-03 20:51:57,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:57,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-09-03 20:51:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,301 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:51:57,301 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:51:57,301 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-03 20:51:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:51:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-03 20:51:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:51:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-03 20:51:57,304 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-03 20:51:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,304 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-03 20:51:57,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-03 20:51:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:51:57,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,305 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-03 20:51:57,305 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-09-03 20:51:57,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,361 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-03 20:51:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:51:57,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:51:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:51:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:51:57,363 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-09-03 20:51:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,454 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-09-03 20:51:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:57,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-09-03 20:51:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,455 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:51:57,455 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:51:57,455 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-03 20:51:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:51:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-09-03 20:51:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:51:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-03 20:51:57,458 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-09-03 20:51:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,458 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-03 20:51:57,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:51:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-03 20:51:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:51:57,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,459 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-03 20:51:57,460 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-09-03 20:51:57,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,498 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-03 20:51:57,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,499 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-09-03 20:51:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,611 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-09-03 20:51:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:57,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-03 20:51:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,613 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:51:57,613 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 20:51:57,613 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-03 20:51:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 20:51:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-09-03 20:51:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 20:51:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-03 20:51:57,616 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-09-03 20:51:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,616 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-03 20:51:57,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-03 20:51:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:51:57,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,617 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-03 20:51:57,618 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-09-03 20:51:57,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,655 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-03 20:51:57,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,657 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-09-03 20:51:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,732 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-03 20:51:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:57,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-03 20:51:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,733 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:51:57,733 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:51:57,734 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-03 20:51:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:51:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 20:51:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:51:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-03 20:51:57,736 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-09-03 20:51:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,736 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-03 20:51:57,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-03 20:51:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:51:57,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,737 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-03 20:51:57,737 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-09-03 20:51:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,782 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-03 20:51:57,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,784 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-09-03 20:51:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,802 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-09-03 20:51:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:57,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-09-03 20:51:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,804 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:51:57,804 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:51:57,804 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-03 20:51:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:51:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-03 20:51:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:51:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-03 20:51:57,808 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-09-03 20:51:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,808 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-03 20:51:57,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-03 20:51:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:51:57,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,809 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-03 20:51:57,810 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-09-03 20:51:57,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,868 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-03 20:51:57,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,870 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-03 20:51:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,905 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-09-03 20:51:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:57,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-03 20:51:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,907 INFO L225 Difference]: With dead ends: 66 [2019-09-03 20:51:57,907 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 20:51:57,908 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-03 20:51:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 20:51:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-03 20:51:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:51:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-03 20:51:57,910 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-09-03 20:51:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,911 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-03 20:51:57,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-03 20:51:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:51:57,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,911 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-03 20:51:57,912 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-09-03 20:51:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,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-03 20:51:57,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,965 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-09-03 20:51:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,078 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-09-03 20:51:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:51:58,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-03 20:51:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,080 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:51:58,080 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:51:58,080 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-03 20:51:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:51:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-09-03 20:51:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:51:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-03 20:51:58,082 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-09-03 20:51:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,083 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-03 20:51:58,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-03 20:51:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:51:58,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,084 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-03 20:51:58,084 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-09-03 20:51:58,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,217 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-03 20:51:58,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:58,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:58,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2019-09-03 20:51:58,219 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-03 20:51:58,228 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:51:58,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:51:58,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:51:58,348 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-03 20:51:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:51:58,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:58,349 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) [2019-09-03 20:51:58,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:51:58,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:58,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:51:58,489 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-03 20:51:58,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:58,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:51:58,532 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-03 20:51:58,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:58,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-09-03 20:51:58,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:58,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:51:58,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:51:58,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:51:58,538 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2019-09-03 20:51:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,660 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-09-03 20:51:58,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:58,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-03 20:51:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,661 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:51:58,661 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:51:58,662 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-03 20:51:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:51:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 20:51:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:51:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-03 20:51:58,665 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-09-03 20:51:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,665 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-03 20:51:58,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:51:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-03 20:51:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:51:58,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,666 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-03 20:51:58,669 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-09-03 20:51:58,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,710 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-03 20:51:58,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:58,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:58,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:58,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:58,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:58,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:58,712 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-03 20:51:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,789 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-03 20:51:58,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:58,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-03 20:51:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,792 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:51:58,792 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:51:58,792 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-03 20:51:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:51:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-03 20:51:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:51:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-03 20:51:58,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-09-03 20:51:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,795 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-03 20:51:58,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-03 20:51:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:51:58,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,796 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-03 20:51:58,797 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-09-03 20:51:58,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,842 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-03 20:51:58,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:58,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:58,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:58,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:58,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:58,843 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-03 20:51:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,950 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-03 20:51:58,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:58,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-03 20:51:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,952 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:51:58,952 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:51:58,952 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-03 20:51:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:51:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-09-03 20:51:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:51:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-09-03 20:51:58,954 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-09-03 20:51:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,955 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-09-03 20:51:58,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-09-03 20:51:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 20:51:58,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,956 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-03 20:51:58,956 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-09-03 20:51:58,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,001 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-03 20:51:59,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:59,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:59,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2019-09-03 20:51:59,003 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-03 20:51:59,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:51:59,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:51:59,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:51:59,160 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-03 20:51:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:51:59,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:59,160 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:51:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:51:59,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:59,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:51:59,275 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-03 20:51:59,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:59,292 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-03 20:51:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:51:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 6 [2019-09-03 20:51:59,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:59,297 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2019-09-03 20:51:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,325 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-09-03 20:51:59,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:59,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-03 20:51:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,326 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:51:59,326 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:51:59,327 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-03 20:51:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:51:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:51:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:51:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:51:59,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-09-03 20:51:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,328 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:51:59,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:51:59,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:51:59,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:51:59 BoogieIcfgContainer [2019-09-03 20:51:59,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:51:59,339 INFO L168 Benchmark]: Toolchain (without parser) took 6754.00 ms. Allocated memory was 137.9 MB in the beginning and 325.1 MB in the end (delta: 187.2 MB). Free memory was 84.9 MB in the beginning and 100.0 MB in the end (delta: -15.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,340 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 103.3 MB in the beginning and 103.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.15 ms. Allocated memory was 137.9 MB in the beginning and 199.2 MB in the end (delta: 61.3 MB). Free memory was 84.7 MB in the beginning and 176.3 MB in the end (delta: -91.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,347 INFO L168 Benchmark]: Boogie Preprocessor took 37.75 ms. Allocated memory is still 199.2 MB. Free memory was 176.3 MB in the beginning and 174.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,348 INFO L168 Benchmark]: RCFGBuilder took 545.66 ms. Allocated memory is still 199.2 MB. Free memory was 174.0 MB in the beginning and 147.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,349 INFO L168 Benchmark]: TraceAbstraction took 5700.71 ms. Allocated memory was 199.2 MB in the beginning and 325.1 MB in the end (delta: 125.8 MB). Free memory was 147.3 MB in the beginning and 100.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 173.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,360 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 103.3 MB in the beginning and 103.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 463.15 ms. Allocated memory was 137.9 MB in the beginning and 199.2 MB in the end (delta: 61.3 MB). Free memory was 84.7 MB in the beginning and 176.3 MB in the end (delta: -91.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.75 ms. Allocated memory is still 199.2 MB. Free memory was 176.3 MB in the beginning and 174.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 545.66 ms. Allocated memory is still 199.2 MB. Free memory was 174.0 MB in the beginning and 147.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5700.71 ms. Allocated memory was 199.2 MB in the beginning and 325.1 MB in the end (delta: 125.8 MB). Free memory was 147.3 MB in the beginning and 100.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 173.1 MB. 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: 172]: 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: 140]: 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: 80]: 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: 303]: 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: 238]: 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: 92]: 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: 209]: 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: 250]: 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 - 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.6s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 2.2s 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.1s 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.7s 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...