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-673a906-m [2019-10-03 02:32:40,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:40,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:40,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:40,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:40,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:40,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:40,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:40,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:40,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:40,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:40,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:40,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:40,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:40,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:40,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:40,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:40,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:40,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:40,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:40,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:40,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:40,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:40,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:40,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:40,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:40,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:40,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:40,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:40,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:40,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:40,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:40,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:40,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:40,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:40,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:40,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:40,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:40,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:40,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:40,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:40,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:32:40,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:40,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:40,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:40,817 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:40,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:40,817 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:40,818 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:40,818 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:40,818 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:40,818 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:40,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:40,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:40,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:40,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:40,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:40,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:40,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:40,822 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:40,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:40,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:40,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:40,824 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:40,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:40,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:40,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:40,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:40,827 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:40,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:40,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:40,827 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:40,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:40,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:40,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:40,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:40,876 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:40,877 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-10-03 02:32:40,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c6ea07d/172cdc2187b046b9909f7d3a417685c2/FLAG6935834ca [2019-10-03 02:32:41,430 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:41,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-03 02:32:41,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c6ea07d/172cdc2187b046b9909f7d3a417685c2/FLAG6935834ca [2019-10-03 02:32:41,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c6ea07d/172cdc2187b046b9909f7d3a417685c2 [2019-10-03 02:32:41,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:41,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:41,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:41,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:41,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:41,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:41" (1/1) ... [2019-10-03 02:32:41,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2aa36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:41, skipping insertion in model container [2019-10-03 02:32:41,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:41" (1/1) ... [2019-10-03 02:32:41,794 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:41,831 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:42,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:42,144 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:42,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:42,365 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:42,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42 WrapperNode [2019-10-03 02:32:42,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:42,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:42,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:42,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:42,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... [2019-10-03 02:32:42,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:42,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:42,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:42,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:42,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:42,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:42,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:42,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:42,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:42,919 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:42,920 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:32:42,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:42 BoogieIcfgContainer [2019-10-03 02:32:42,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:42,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:42,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:42,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:42,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:41" (1/3) ... [2019-10-03 02:32:42,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cad3880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:42, skipping insertion in model container [2019-10-03 02:32:42,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:42" (2/3) ... [2019-10-03 02:32:42,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cad3880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:42, skipping insertion in model container [2019-10-03 02:32:42,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:42" (3/3) ... [2019-10-03 02:32:42,929 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-10-03 02:32:42,940 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:42,952 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-03 02:32:42,971 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-03 02:32:42,995 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:42,995 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:42,995 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:42,995 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:42,996 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:42,996 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:42,996 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:42,996 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-03 02:32:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:32:43,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:43,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:43,026 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-10-03 02:32:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:43,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:43,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:43,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-10-03 02:32:43,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:43,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:43,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:43,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:43,249 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-10-03 02:32:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:43,282 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2019-10-03 02:32:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:43,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-03 02:32:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:43,295 INFO L225 Difference]: With dead ends: 87 [2019-10-03 02:32:43,295 INFO L226 Difference]: Without dead ends: 80 [2019-10-03 02:32:43,297 INFO L640 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-10-03 02:32:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-03 02:32:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-03 02:32:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-03 02:32:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-03 02:32:43,338 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-10-03 02:32:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:43,339 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-03 02:32:43,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-03 02:32:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:43,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:43,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:43,342 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:43,342 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-10-03 02:32:43,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:43,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:43,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:43,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:43,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:43,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:43,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:43,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:43,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:43,445 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-10-03 02:32:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:43,610 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-10-03 02:32:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:43,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-03 02:32:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:43,613 INFO L225 Difference]: With dead ends: 78 [2019-10-03 02:32:43,613 INFO L226 Difference]: Without dead ends: 78 [2019-10-03 02:32:43,617 INFO L640 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-10-03 02:32:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-03 02:32:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-03 02:32:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-03 02:32:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-03 02:32:43,634 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-10-03 02:32:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:43,634 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-03 02:32:43,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-03 02:32:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:32:43,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:43,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:43,637 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-10-03 02:32:43,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:43,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:43,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:43,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:43,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:43,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:43,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:43,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:43,726 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-10-03 02:32:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:43,848 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-10-03 02:32:43,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:43,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-03 02:32:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:43,851 INFO L225 Difference]: With dead ends: 99 [2019-10-03 02:32:43,851 INFO L226 Difference]: Without dead ends: 99 [2019-10-03 02:32:43,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-03 02:32:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-10-03 02:32:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-03 02:32:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-03 02:32:43,861 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-10-03 02:32:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:43,861 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-03 02:32:43,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-03 02:32:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:32:43,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:43,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:43,864 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-10-03 02:32:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:43,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:43,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:43,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:43,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:43,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:43,932 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-10-03 02:32:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:44,035 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-10-03 02:32:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:44,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-03 02:32:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:44,037 INFO L225 Difference]: With dead ends: 74 [2019-10-03 02:32:44,038 INFO L226 Difference]: Without dead ends: 74 [2019-10-03 02:32:44,038 INFO L640 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-10-03 02:32:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-03 02:32:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-03 02:32:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-03 02:32:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-10-03 02:32:44,045 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-10-03 02:32:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:44,045 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-10-03 02:32:44,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-10-03 02:32:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:32:44,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:44,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:44,063 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-10-03 02:32:44,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:44,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:44,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:44,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:44,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:44,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:44,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:44,175 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-10-03 02:32:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:44,359 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-10-03 02:32:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:44,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-03 02:32:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:44,364 INFO L225 Difference]: With dead ends: 139 [2019-10-03 02:32:44,364 INFO L226 Difference]: Without dead ends: 139 [2019-10-03 02:32:44,365 INFO L640 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-10-03 02:32:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-03 02:32:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-10-03 02:32:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-03 02:32:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-03 02:32:44,381 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-10-03 02:32:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:44,382 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-03 02:32:44,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-03 02:32:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:32:44,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:44,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:44,386 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-10-03 02:32:44,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:44,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:44,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:44,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:44,502 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-10-03 02:32:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:44,659 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2019-10-03 02:32:44,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:44,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-03 02:32:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:44,661 INFO L225 Difference]: With dead ends: 106 [2019-10-03 02:32:44,663 INFO L226 Difference]: Without dead ends: 106 [2019-10-03 02:32:44,664 INFO L640 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-10-03 02:32:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-03 02:32:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-10-03 02:32:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-03 02:32:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-10-03 02:32:44,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-10-03 02:32:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:44,678 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-10-03 02:32:44,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-10-03 02:32:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:32:44,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:44,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:44,684 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-10-03 02:32:44,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:44,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:44,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:44,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:44,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:44,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:44,767 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-10-03 02:32:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:44,902 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-10-03 02:32:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:44,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-03 02:32:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:44,904 INFO L225 Difference]: With dead ends: 119 [2019-10-03 02:32:44,904 INFO L226 Difference]: Without dead ends: 119 [2019-10-03 02:32:44,905 INFO L640 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-10-03 02:32:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-03 02:32:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-10-03 02:32:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-03 02:32:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-03 02:32:44,911 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-10-03 02:32:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:44,911 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-03 02:32:44,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-03 02:32:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:32:44,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:44,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:44,913 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-10-03 02:32:44,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:44,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:44,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:44,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:44,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:44,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:44,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:44,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:44,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:44,982 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-10-03 02:32:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:45,089 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-10-03 02:32:45,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:45,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-03 02:32:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:45,091 INFO L225 Difference]: With dead ends: 75 [2019-10-03 02:32:45,091 INFO L226 Difference]: Without dead ends: 75 [2019-10-03 02:32:45,092 INFO L640 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-10-03 02:32:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-03 02:32:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-03 02:32:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-03 02:32:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-03 02:32:45,098 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-10-03 02:32:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:45,099 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-03 02:32:45,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-03 02:32:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:32:45,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:45,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:45,107 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-10-03 02:32:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:45,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:45,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:45,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:45,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:45,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:45,174 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-10-03 02:32:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:45,218 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-10-03 02:32:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:45,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:32:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:45,220 INFO L225 Difference]: With dead ends: 79 [2019-10-03 02:32:45,220 INFO L226 Difference]: Without dead ends: 75 [2019-10-03 02:32:45,222 INFO L640 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-10-03 02:32:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-03 02:32:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-03 02:32:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-03 02:32:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-10-03 02:32:45,227 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-10-03 02:32:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:45,227 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-10-03 02:32:45,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-10-03 02:32:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:32:45,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:45,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:45,230 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-10-03 02:32:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:45,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:45,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:45,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:45,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:45,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:45,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:45,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:45,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:45,332 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-10-03 02:32:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:45,422 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-10-03 02:32:45,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:45,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-03 02:32:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:45,424 INFO L225 Difference]: With dead ends: 74 [2019-10-03 02:32:45,424 INFO L226 Difference]: Without dead ends: 74 [2019-10-03 02:32:45,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-03 02:32:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-03 02:32:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-03 02:32:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-10-03 02:32:45,434 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-10-03 02:32:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:45,434 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-10-03 02:32:45,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-10-03 02:32:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:32:45,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:45,436 INFO L411 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-10-03 02:32:45,436 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-10-03 02:32:45,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:45,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:45,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:45,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:45,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-10-03 02:32:45,546 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-10-03 02:32:45,585 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:45,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:45,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:45,840 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-10-03 02:32:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:45,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:45,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:45,846 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-10-03 02:32:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:45,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 02:32:45,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:45,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:45,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:46,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-10-03 02:32:46,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:46,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:32:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:32:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:32:46,035 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 8 states. [2019-10-03 02:32:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,183 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-10-03 02:32:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:46,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-03 02:32:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,185 INFO L225 Difference]: With dead ends: 109 [2019-10-03 02:32:46,186 INFO L226 Difference]: Without dead ends: 109 [2019-10-03 02:32:46,186 INFO L640 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-10-03 02:32:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-03 02:32:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-10-03 02:32:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-03 02:32:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-03 02:32:46,190 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-10-03 02:32:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,197 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-03 02:32:46,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:32:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-03 02:32:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:32:46,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,199 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-10-03 02:32:46,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:46,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:46,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:46,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:46,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:46,252 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-10-03 02:32:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,320 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-10-03 02:32:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:46,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-03 02:32:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,321 INFO L225 Difference]: With dead ends: 68 [2019-10-03 02:32:46,321 INFO L226 Difference]: Without dead ends: 68 [2019-10-03 02:32:46,322 INFO L640 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-10-03 02:32:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-03 02:32:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-03 02:32:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-03 02:32:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-03 02:32:46,325 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-10-03 02:32:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,326 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-03 02:32:46,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-03 02:32:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:32:46,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,327 INFO L411 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-10-03 02:32:46,327 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-10-03 02:32:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:46,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:46,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:46,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-10-03 02:32:46,388 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-10-03 02:32:46,391 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:46,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:46,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:46,489 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-10-03 02:32:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:46,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:46,490 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-10-03 02:32:46,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 02:32:46,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:46,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:46,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:46,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-10-03 02:32:46,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:46,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:32:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:32:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:32:46,634 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-10-03 02:32:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,761 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-03 02:32:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:46,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-10-03 02:32:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,763 INFO L225 Difference]: With dead ends: 67 [2019-10-03 02:32:46,763 INFO L226 Difference]: Without dead ends: 67 [2019-10-03 02:32:46,763 INFO L640 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-10-03 02:32:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-03 02:32:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-10-03 02:32:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-03 02:32:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-03 02:32:46,770 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-10-03 02:32:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,770 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-03 02:32:46,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:32:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-03 02:32:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:32:46,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,772 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-10-03 02:32:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:46,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:46,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:46,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:46,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:46,839 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-10-03 02:32:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,911 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-10-03 02:32:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:46,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-03 02:32:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,912 INFO L225 Difference]: With dead ends: 61 [2019-10-03 02:32:46,912 INFO L226 Difference]: Without dead ends: 61 [2019-10-03 02:32:46,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-03 02:32:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-03 02:32:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-03 02:32:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-03 02:32:46,916 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-10-03 02:32:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,916 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-03 02:32:46,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-03 02:32:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:32:46,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,920 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-10-03 02:32:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:46,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:46,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:32:46,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:46,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:32:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:32:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:46,998 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-10-03 02:32:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,117 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-03 02:32:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:47,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-10-03 02:32:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,118 INFO L225 Difference]: With dead ends: 69 [2019-10-03 02:32:47,118 INFO L226 Difference]: Without dead ends: 69 [2019-10-03 02:32:47,119 INFO L640 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-10-03 02:32:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-03 02:32:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-03 02:32:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-03 02:32:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-03 02:32:47,123 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-10-03 02:32:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,123 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-03 02:32:47,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:32:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-03 02:32:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 02:32:47,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,125 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-10-03 02:32:47,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,174 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-10-03 02:32:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,293 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-10-03 02:32:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:47,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-03 02:32:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,294 INFO L225 Difference]: With dead ends: 89 [2019-10-03 02:32:47,295 INFO L226 Difference]: Without dead ends: 89 [2019-10-03 02:32:47,295 INFO L640 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-10-03 02:32:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-03 02:32:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-03 02:32:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-03 02:32:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-03 02:32:47,299 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-10-03 02:32:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,299 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-03 02:32:47,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-03 02:32:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:32:47,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,301 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-10-03 02:32:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,374 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-10-03 02:32:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,453 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-10-03 02:32:47,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:47,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-03 02:32:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,454 INFO L225 Difference]: With dead ends: 59 [2019-10-03 02:32:47,454 INFO L226 Difference]: Without dead ends: 59 [2019-10-03 02:32:47,454 INFO L640 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-10-03 02:32:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-03 02:32:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-03 02:32:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-03 02:32:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-03 02:32:47,457 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-10-03 02:32:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,458 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-03 02:32:47,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-03 02:32:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 02:32:47,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,460 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-10-03 02:32:47,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,515 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-10-03 02:32:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,532 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-10-03 02:32:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:47,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-03 02:32:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,534 INFO L225 Difference]: With dead ends: 68 [2019-10-03 02:32:47,534 INFO L226 Difference]: Without dead ends: 68 [2019-10-03 02:32:47,534 INFO L640 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-10-03 02:32:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-03 02:32:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-03 02:32:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-03 02:32:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-03 02:32:47,537 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-10-03 02:32:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,538 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-03 02:32:47,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-03 02:32:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 02:32:47,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,539 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-10-03 02:32:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,606 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-03 02:32:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,633 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-10-03 02:32:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:47,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-03 02:32:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,634 INFO L225 Difference]: With dead ends: 66 [2019-10-03 02:32:47,634 INFO L226 Difference]: Without dead ends: 66 [2019-10-03 02:32:47,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-03 02:32:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-03 02:32:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-03 02:32:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-03 02:32:47,637 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-10-03 02:32:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,638 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-03 02:32:47,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-03 02:32:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 02:32:47,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:47,639 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-10-03 02:32:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:47,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:47,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:47,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:47,702 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-03 02:32:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:47,833 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-10-03 02:32:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:47,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-03 02:32:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:47,834 INFO L225 Difference]: With dead ends: 88 [2019-10-03 02:32:47,834 INFO L226 Difference]: Without dead ends: 88 [2019-10-03 02:32:47,835 INFO L640 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-10-03 02:32:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-03 02:32:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-10-03 02:32:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-03 02:32:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-10-03 02:32:47,838 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-10-03 02:32:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:47,838 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-10-03 02:32:47,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-10-03 02:32:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:32:47,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:47,839 INFO L411 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-10-03 02:32:47,839 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-10-03 02:32:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:47,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:47,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:47,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:47,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2019-10-03 02:32:47,918 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-10-03 02:32:47,922 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:47,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:48,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:48,006 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-10-03 02:32:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:48,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:48,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 02:32:48,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:48,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-10-03 02:32:48,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:48,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:32:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:32:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:32:48,279 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2019-10-03 02:32:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:48,427 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-03 02:32:48,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:48,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-03 02:32:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,428 INFO L225 Difference]: With dead ends: 68 [2019-10-03 02:32:48,428 INFO L226 Difference]: Without dead ends: 68 [2019-10-03 02:32:48,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 13 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-03 02:32:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-03 02:32:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-03 02:32:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-03 02:32:48,431 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-10-03 02:32:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:48,432 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-03 02:32:48,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:32:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-03 02:32:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:32:48,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:48,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:48,433 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-10-03 02:32:48,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:48,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:48,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:48,482 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-03 02:32:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:48,568 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-03 02:32:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:48,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-03 02:32:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,571 INFO L225 Difference]: With dead ends: 69 [2019-10-03 02:32:48,571 INFO L226 Difference]: Without dead ends: 69 [2019-10-03 02:32:48,571 INFO L640 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-10-03 02:32:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-03 02:32:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-03 02:32:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-03 02:32:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-03 02:32:48,574 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-10-03 02:32:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:48,574 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-03 02:32:48,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-03 02:32:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:32:48,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:48,575 INFO L411 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-10-03 02:32:48,575 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:48,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-10-03 02:32:48,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:48,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:32:48,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:48,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:48,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:48,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:48,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:48,626 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-03 02:32:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:48,750 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-10-03 02:32:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:48,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-03 02:32:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:48,753 INFO L225 Difference]: With dead ends: 75 [2019-10-03 02:32:48,753 INFO L226 Difference]: Without dead ends: 75 [2019-10-03 02:32:48,753 INFO L640 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-10-03 02:32:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-03 02:32:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-10-03 02:32:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-03 02:32:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-03 02:32:48,756 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-10-03 02:32:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:48,756 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-03 02:32:48,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-03 02:32:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:32:48,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:48,757 INFO L411 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-10-03 02:32:48,758 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:48,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-10-03 02:32:48,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:48,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:48,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:48,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:48,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:48,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2019-10-03 02:32:48,805 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-10-03 02:32:48,808 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:48,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:48,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:48,956 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-10-03 02:32:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:48,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:48,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:48,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-03 02:32:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:48,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:49,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-03 02:32:49,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:32:49,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:32:49,064 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:49,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 6 [2019-10-03 02:32:49,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:49,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:49,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:49,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:49,066 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2019-10-03 02:32:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:49,099 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-10-03 02:32:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:49,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-03 02:32:49,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:49,100 INFO L225 Difference]: With dead ends: 58 [2019-10-03 02:32:49,100 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:32:49,100 INFO L640 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-10-03 02:32:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:32:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:32:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:32:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:32:49,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-03 02:32:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:49,102 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:32:49,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:32:49,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:32:49,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:32:49 BoogieIcfgContainer [2019-10-03 02:32:49,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:32:49,110 INFO L168 Benchmark]: Toolchain (without parser) took 7332.90 ms. Allocated memory was 140.0 MB in the beginning and 310.4 MB in the end (delta: 170.4 MB). Free memory was 86.3 MB in the beginning and 230.9 MB in the end (delta: -144.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:49,111 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:32:49,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.53 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 86.1 MB in the beginning and 177.5 MB in the end (delta: -91.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:49,113 INFO L168 Benchmark]: Boogie Preprocessor took 55.41 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 175.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:49,113 INFO L168 Benchmark]: RCFGBuilder took 499.26 ms. Allocated memory is still 200.3 MB. Free memory was 175.7 MB in the beginning and 149.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:49,114 INFO L168 Benchmark]: TraceAbstraction took 6185.13 ms. Allocated memory was 200.3 MB in the beginning and 310.4 MB in the end (delta: 110.1 MB). Free memory was 148.5 MB in the beginning and 230.9 MB in the end (delta: -82.4 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:49,118 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.17 ms. Allocated memory is still 140.0 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 588.53 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 86.1 MB in the beginning and 177.5 MB in the end (delta: -91.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.41 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 175.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 499.26 ms. Allocated memory is still 200.3 MB. Free memory was 175.7 MB in the beginning and 149.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6185.13 ms. Allocated memory was 200.3 MB in the beginning and 310.4 MB in the end (delta: 110.1 MB). Free memory was 148.5 MB in the beginning and 230.9 MB in the end (delta: -82.4 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: 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: 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: 279]: 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: 267]: 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: 291]: 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: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 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: 209]: 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: 303]: 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 - 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, 6.1s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1400 SDtfs, 2395 SDslu, 1864 SDs, 0 SdLazy, 1182 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 337 SyntacticMatches, 27 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1081 ConstructedInterpolants, 0 QuantifiedInterpolants, 95518 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...