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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:51:48,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:48,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:48,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:48,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:48,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:48,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:48,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:48,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:48,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:48,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:48,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:48,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:48,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:48,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:48,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:48,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:48,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:48,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:48,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:48,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:48,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:48,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:48,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:48,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:48,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:48,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:48,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:48,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:48,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:48,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:48,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:48,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:48,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:48,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:48,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:48,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:48,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:48,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:48,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:48,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:48,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:51:48,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:48,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:48,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:48,816 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:48,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:48,817 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:48,817 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:48,817 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:48,817 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:48,818 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:48,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:48,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:48,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:48,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:48,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:48,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:48,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:48,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:48,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:48,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:48,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:48,822 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:48,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:48,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:48,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:48,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:48,823 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:48,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:48,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:48,824 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:48,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:48,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:48,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:48,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:48,887 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:48,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-03 20:51:48,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434041293/4fa2bdb0b949447a93b38fd4fb1963be/FLAGf2b61d0e1 [2019-09-03 20:51:49,422 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:49,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-03 20:51:49,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434041293/4fa2bdb0b949447a93b38fd4fb1963be/FLAGf2b61d0e1 [2019-09-03 20:51:49,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434041293/4fa2bdb0b949447a93b38fd4fb1963be [2019-09-03 20:51:49,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:49,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:49,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:49,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:49,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:49,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:49" (1/1) ... [2019-09-03 20:51:49,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc9456c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:49, skipping insertion in model container [2019-09-03 20:51:49,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:49" (1/1) ... [2019-09-03 20:51:49,797 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:49,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:50,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:50,056 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:50,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:50,185 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:50,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50 WrapperNode [2019-09-03 20:51:50,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:50,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:50,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:50,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:50,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... [2019-09-03 20:51:50,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:50,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:50,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:50,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:50,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:50,631 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:50,631 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:50,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:50 BoogieIcfgContainer [2019-09-03 20:51:50,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:50,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:50,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:50,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:50,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:49" (1/3) ... [2019-09-03 20:51:50,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49628e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:50, skipping insertion in model container [2019-09-03 20:51:50,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:50" (2/3) ... [2019-09-03 20:51:50,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49628e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:50, skipping insertion in model container [2019-09-03 20:51:50,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:50" (3/3) ... [2019-09-03 20:51:50,638 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-03 20:51:50,646 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:50,654 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 20:51:50,670 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 20:51:50,709 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:50,709 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:50,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:50,709 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:50,710 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:50,710 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:50,710 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:50,710 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-09-03 20:51:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:51:50,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:50,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:50,741 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:50,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-09-03 20:51:50,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:50,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:50,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:50,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:50,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:50,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:50,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:50,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:50,931 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-09-03 20:51:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:50,965 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-09-03 20:51:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:50,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 20:51:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:50,980 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:51:50,980 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:51:50,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:51:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-03 20:51:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:51:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-03 20:51:51,050 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-09-03 20:51:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,051 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-03 20:51:51,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-03 20:51:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:51:51,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,057 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,059 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-09-03 20:51:51,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:51,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:51,157 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-03 20:51:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,288 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-09-03 20:51:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:51,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-03 20:51:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,291 INFO L225 Difference]: With dead ends: 101 [2019-09-03 20:51:51,291 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:51:51,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:51:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-09-03 20:51:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:51:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-03 20:51:51,301 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-09-03 20:51:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,302 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-03 20:51:51,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-03 20:51:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:51:51,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,304 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-09-03 20:51:51,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:51,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:51,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:51,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:51,350 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-09-03 20:51:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,443 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-09-03 20:51:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:51,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-03 20:51:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,446 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:51:51,446 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:51:51,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:51:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-09-03 20:51:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:51:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-03 20:51:51,460 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-09-03 20:51:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,460 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-03 20:51:51,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-03 20:51:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:51:51,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,463 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-09-03 20:51:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:51,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:51,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:51,506 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-09-03 20:51:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,583 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-09-03 20:51:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:51,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-03 20:51:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,585 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:51:51,586 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:51:51,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:51:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-09-03 20:51:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:51:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-03 20:51:51,593 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-09-03 20:51:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,593 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-03 20:51:51,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-03 20:51:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:51:51,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,595 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-09-03 20:51:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:51,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,670 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-03 20:51:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,803 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-03 20:51:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:51,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 20:51:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,805 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:51:51,805 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:51:51,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:51:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:51:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-09-03 20:51:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:51:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-03 20:51:51,811 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-09-03 20:51:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-03 20:51:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-03 20:51:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:51:51,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,813 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-09-03 20:51:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:51,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:51,860 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-09-03 20:51:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:51,920 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-03 20:51:51,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:51,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 20:51:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:51,921 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:51:51,921 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:51:51,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:51:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-09-03 20:51:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:51:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-03 20:51:51,926 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-09-03 20:51:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:51,927 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-03 20:51:51,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-03 20:51:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:51:51,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:51,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:51,929 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:51,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-09-03 20:51:51,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:51,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:51,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:51,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:51,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:51,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:51,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:51,995 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-09-03 20:51:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,061 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-09-03 20:51:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:52,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-03 20:51:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,062 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:51:52,062 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 20:51:52,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 20:51:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-09-03 20:51:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:51:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-03 20:51:52,067 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-09-03 20:51:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,067 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-03 20:51:52,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-03 20:51:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:51:52,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,069 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-09-03 20:51:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:52,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,131 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-09-03 20:51:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,259 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-03 20:51:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:52,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:51:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,261 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:51:52,261 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 20:51:52,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:51:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 20:51:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-09-03 20:51:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:51:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-03 20:51:52,266 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-09-03 20:51:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,266 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-03 20:51:52,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-03 20:51:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:51:52,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,268 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-09-03 20:51:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:52,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,321 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-09-03 20:51:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,391 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-03 20:51:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:52,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:51:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,392 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:51:52,392 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:51:52,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:51:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:51:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-09-03 20:51:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:51:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-03 20:51:52,399 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-09-03 20:51:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,399 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-03 20:51:52,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-03 20:51:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:51:52,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,401 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-09-03 20:51:52,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:52,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:52,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:52,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:52,462 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-09-03 20:51:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,510 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-03 20:51:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:52,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-03 20:51:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,511 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:51:52,511 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:51:52,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:51:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-09-03 20:51:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:51:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-03 20:51:52,515 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-09-03 20:51:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,515 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-03 20:51:52,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-03 20:51:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:51:52,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,517 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-09-03 20:51:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:52,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:52,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:52,556 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-09-03 20:51:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,612 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-03 20:51:52,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:52,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 20:51:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,614 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:51:52,614 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:51:52,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:51:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-09-03 20:51:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:51:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 20:51:52,620 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-09-03 20:51:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,620 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 20:51:52,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 20:51:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:51:52,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,628 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-09-03 20:51:52,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:52,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:52,677 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-09-03 20:51:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:52,768 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-03 20:51:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:52,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-03 20:51:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:52,769 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:51:52,769 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:51:52,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:51:52,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-09-03 20:51:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:51:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-03 20:51:52,773 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-09-03 20:51:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:52,773 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-03 20:51:52,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-03 20:51:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:51:52,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:52,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:52,776 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-09-03 20:51:52,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:52,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:52,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:52,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:52,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:52,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:52,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:52,861 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-09-03 20:51:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,001 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-09-03 20:51:53,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:53,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-03 20:51:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:53,003 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:51:53,003 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:51:53,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:51:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:51:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-09-03 20:51:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:51:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-03 20:51:53,006 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-09-03 20:51:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:53,008 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-03 20:51:53,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-03 20:51:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:51:53,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:53,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:53,011 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-09-03 20:51:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:53,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:53,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:53,075 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-09-03 20:51:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,173 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-03 20:51:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:53,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-03 20:51:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:53,174 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:51:53,175 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:51:53,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:51:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:51:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-09-03 20:51:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:51:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-03 20:51:53,183 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-09-03 20:51:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:53,183 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-03 20:51:53,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-03 20:51:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:51:53,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:53,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:53,187 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-09-03 20:51:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:53,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:53,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:53,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:53,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:53,251 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-09-03 20:51:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,372 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-09-03 20:51:53,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:53,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-03 20:51:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:53,373 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:51:53,374 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:51:53,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:51:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:51:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-09-03 20:51:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:51:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-03 20:51:53,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-03 20:51:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:53,377 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-03 20:51:53,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-03 20:51:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:51:53,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:53,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:53,381 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-09-03 20:51:53,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:53,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:53,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:53,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:53,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:53,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:53,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:53,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:53,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:53,422 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-03 20:51:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:53,553 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-09-03 20:51:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:53,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-03 20:51:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:53,554 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:51:53,554 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:51:53,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:51:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:51:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:51:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:51:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:51:53,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-03 20:51:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:53,556 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:51:53,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:51:53,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:51:53,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:51:53 BoogieIcfgContainer [2019-09-03 20:51:53,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:51:53,564 INFO L168 Benchmark]: Toolchain (without parser) took 3783.07 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 90.3 MB in the beginning and 142.7 MB in the end (delta: -52.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,565 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.48 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 90.1 MB in the beginning and 178.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,566 INFO L168 Benchmark]: Boogie Preprocessor took 33.88 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 176.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,567 INFO L168 Benchmark]: RCFGBuilder took 410.63 ms. Allocated memory is still 201.3 MB. Free memory was 176.5 MB in the beginning and 154.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,568 INFO L168 Benchmark]: TraceAbstraction took 2928.12 ms. Allocated memory was 201.3 MB in the beginning and 256.9 MB in the end (delta: 55.6 MB). Free memory was 154.9 MB in the beginning and 142.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:53,572 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 405.48 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 90.1 MB in the beginning and 178.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.88 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 176.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 410.63 ms. Allocated memory is still 201.3 MB. Free memory was 176.5 MB in the beginning and 154.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2928.12 ms. Allocated memory was 201.3 MB in the beginning and 256.9 MB in the end (delta: 55.6 MB). Free memory was 154.9 MB in the beginning and 142.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: 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: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 2.8s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 1252 SDslu, 802 SDs, 0 SdLazy, 796 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...