java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:03:20,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:03:20,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:03:20,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:03:20,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:03:20,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:03:20,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:03:20,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:03:20,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:03:20,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:03:20,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:03:20,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:03:20,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:03:20,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:03:20,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:03:20,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:03:20,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:03:20,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:03:20,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:03:20,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:03:20,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:03:20,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:03:20,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:03:20,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:03:20,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:03:20,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:03:20,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:03:20,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:03:20,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:03:20,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:03:20,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:03:20,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:03:20,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:03:20,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:03:20,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:03:20,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:03:20,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:03:20,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:03:20,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:03:20,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:03:20,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:03:20,639 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-16 17:03:20,670 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:03:20,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:03:20,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:03:20,672 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:03:20,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:03:20,673 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:03:20,673 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:03:20,673 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:03:20,673 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:03:20,674 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:03:20,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:03:20,676 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:03:20,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:03:20,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:03:20,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:03:20,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:03:20,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:03:20,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:03:20,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:03:20,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:03:20,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:03:20,678 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:03:20,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:03:20,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:03:20,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:03:20,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:03:20,679 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:03:20,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:03:20,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:03:20,680 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:03:20,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:03:20,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:03:20,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:03:20,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:03:20,759 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:03:20,760 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-16 17:03:20,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd27677f0/c8605d76ffee4b82a15234713140f997/FLAG9e78ad1b8 [2019-09-16 17:03:21,291 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:03:21,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-16 17:03:21,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd27677f0/c8605d76ffee4b82a15234713140f997/FLAG9e78ad1b8 [2019-09-16 17:03:21,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd27677f0/c8605d76ffee4b82a15234713140f997 [2019-09-16 17:03:21,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:03:21,684 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:03:21,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:21,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:03:21,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:03:21,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:21" (1/1) ... [2019-09-16 17:03:21,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3038ff1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:21, skipping insertion in model container [2019-09-16 17:03:21,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:21" (1/1) ... [2019-09-16 17:03:21,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:03:21,741 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:03:21,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:21,948 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:03:22,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:22,130 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:03:22,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22 WrapperNode [2019-09-16 17:03:22,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:22,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:03:22,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:03:22,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:03:22,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:03:22,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:03:22,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:03:22,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:03:22,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (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-16 17:03:22,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:03:22,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:03:22,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:03:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:03:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:03:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 17:03:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:03:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:03:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:03:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:03:22,668 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:03:22,669 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 17:03:22,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:22 BoogieIcfgContainer [2019-09-16 17:03:22,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:03:22,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:03:22,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:03:22,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:03:22,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:03:21" (1/3) ... [2019-09-16 17:03:22,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417e894b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:22, skipping insertion in model container [2019-09-16 17:03:22,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (2/3) ... [2019-09-16 17:03:22,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417e894b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:22, skipping insertion in model container [2019-09-16 17:03:22,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:22" (3/3) ... [2019-09-16 17:03:22,680 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-09-16 17:03:22,690 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:03:22,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-16 17:03:22,712 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-16 17:03:22,738 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:03:22,738 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:03:22,738 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:03:22,738 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:03:22,739 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:03:22,739 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:03:22,739 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:03:22,739 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:03:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-09-16 17:03:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 17:03:22,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:22,768 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:22,771 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-09-16 17:03:22,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:22,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:22,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:22,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:22,958 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-16 17:03:22,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:22,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:22,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:22,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:22,981 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-09-16 17:03:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,184 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-09-16 17:03:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 17:03:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,198 INFO L225 Difference]: With dead ends: 125 [2019-09-16 17:03:23,198 INFO L226 Difference]: Without dead ends: 111 [2019-09-16 17:03:23,200 INFO L636 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-16 17:03:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-16 17:03:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-09-16 17:03:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-16 17:03:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-16 17:03:23,248 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-09-16 17:03:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,249 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-16 17:03:23,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-16 17:03:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 17:03:23,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,251 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,252 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-09-16 17:03:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,333 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-16 17:03:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:23,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:23,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:23,342 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-09-16 17:03:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,434 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-09-16 17:03:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 17:03:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,438 INFO L225 Difference]: With dead ends: 109 [2019-09-16 17:03:23,438 INFO L226 Difference]: Without dead ends: 109 [2019-09-16 17:03:23,439 INFO L636 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-16 17:03:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-16 17:03:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-09-16 17:03:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-16 17:03:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-16 17:03:23,449 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-09-16 17:03:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,449 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-16 17:03:23,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-16 17:03:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:23,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,451 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,452 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-09-16 17:03:23,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,522 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-16 17:03:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:23,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:23,527 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-09-16 17:03:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,655 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-16 17:03:23,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 17:03:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,658 INFO L225 Difference]: With dead ends: 71 [2019-09-16 17:03:23,658 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 17:03:23,659 INFO L636 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-16 17:03:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 17:03:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-16 17:03:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-16 17:03:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-16 17:03:23,667 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-09-16 17:03:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,667 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-16 17:03:23,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-16 17:03:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:23,669 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,669 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,670 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-09-16 17:03:23,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,717 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-16 17:03:23,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:23,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:23,719 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-09-16 17:03:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,814 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-16 17:03:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 17:03:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,816 INFO L225 Difference]: With dead ends: 69 [2019-09-16 17:03:23,816 INFO L226 Difference]: Without dead ends: 69 [2019-09-16 17:03:23,817 INFO L636 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-16 17:03:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-16 17:03:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-16 17:03:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-16 17:03:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-16 17:03:23,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-09-16 17:03:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,822 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-16 17:03:23,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-16 17:03:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:23,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,824 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,824 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-09-16 17:03:23,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,907 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-16 17:03:23,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:23,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:23,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:23,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:23,909 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-16 17:03:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,035 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-09-16 17:03:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:24,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-16 17:03:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,037 INFO L225 Difference]: With dead ends: 114 [2019-09-16 17:03:24,038 INFO L226 Difference]: Without dead ends: 114 [2019-09-16 17:03:24,038 INFO L636 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-16 17:03:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-16 17:03:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-09-16 17:03:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-16 17:03:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-16 17:03:24,044 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-09-16 17:03:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,044 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-16 17:03:24,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-16 17:03:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:24,045 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,045 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,046 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-09-16 17:03:24,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,091 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-16 17:03:24,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:24,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:24,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:24,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:24,093 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-16 17:03:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,207 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-09-16 17:03:24,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:24,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-16 17:03:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,208 INFO L225 Difference]: With dead ends: 99 [2019-09-16 17:03:24,209 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 17:03:24,209 INFO L636 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-16 17:03:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 17:03:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-09-16 17:03:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-16 17:03:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-16 17:03:24,214 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-09-16 17:03:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,214 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-16 17:03:24,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-16 17:03:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:24,215 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,216 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,216 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-09-16 17:03:24,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,257 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-16 17:03:24,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:24,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:24,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:24,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:24,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:24,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:24,261 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-09-16 17:03:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,318 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-16 17:03:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:24,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 17:03:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,320 INFO L225 Difference]: With dead ends: 63 [2019-09-16 17:03:24,320 INFO L226 Difference]: Without dead ends: 61 [2019-09-16 17:03:24,320 INFO L636 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-16 17:03:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-16 17:03:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-16 17:03:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-16 17:03:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-16 17:03:24,328 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-09-16 17:03:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,329 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-16 17:03:24,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-16 17:03:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:24,330 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,330 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,331 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-09-16 17:03:24,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,378 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-16 17:03:24,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:24,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:24,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:24,380 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-16 17:03:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,427 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-16 17:03:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:24,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 17:03:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,428 INFO L225 Difference]: With dead ends: 59 [2019-09-16 17:03:24,428 INFO L226 Difference]: Without dead ends: 57 [2019-09-16 17:03:24,429 INFO L636 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-16 17:03:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-16 17:03:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-16 17:03:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 17:03:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-16 17:03:24,434 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-09-16 17:03:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,435 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-16 17:03:24,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-16 17:03:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:03:24,436 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,436 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,437 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-09-16 17:03:24,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,503 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer.transform(NonCoreBooleanSubTermTransformer.java:51) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:585) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 17:03:24,508 INFO L168 Benchmark]: Toolchain (without parser) took 2822.80 ms. Allocated memory was 139.5 MB in the beginning and 223.3 MB in the end (delta: 83.9 MB). Free memory was 87.0 MB in the beginning and 116.4 MB in the end (delta: -29.4 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,510 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.93 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 86.8 MB in the beginning and 176.9 MB in the end (delta: -90.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,514 INFO L168 Benchmark]: Boogie Preprocessor took 35.64 ms. Allocated memory is still 199.2 MB. Free memory was 176.9 MB in the beginning and 175.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,514 INFO L168 Benchmark]: RCFGBuilder took 502.56 ms. Allocated memory is still 199.2 MB. Free memory was 174.4 MB in the beginning and 150.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,519 INFO L168 Benchmark]: TraceAbstraction took 1834.17 ms. Allocated memory was 199.2 MB in the beginning and 223.3 MB in the end (delta: 24.1 MB). Free memory was 149.4 MB in the beginning and 116.4 MB in the end (delta: 33.0 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,525 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.93 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 86.8 MB in the beginning and 176.9 MB in the end (delta: -90.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.64 ms. Allocated memory is still 199.2 MB. Free memory was 176.9 MB in the beginning and 175.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 502.56 ms. Allocated memory is still 199.2 MB. Free memory was 174.4 MB in the beginning and 150.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1834.17 ms. Allocated memory was 199.2 MB in the beginning and 223.3 MB in the end (delta: 24.1 MB). Free memory was 149.4 MB in the beginning and 116.4 MB in the end (delta: 33.0 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...