java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 09:39:25,738 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 09:39:25,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 09:39:25,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 09:39:25,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 09:39:25,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 09:39:25,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 09:39:25,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 09:39:25,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 09:39:25,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 09:39:25,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 09:39:25,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 09:39:25,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 09:39:25,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 09:39:25,785 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 09:39:25,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 09:39:25,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 09:39:25,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 09:39:25,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 09:39:25,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 09:39:25,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 09:39:25,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 09:39:25,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 09:39:25,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 09:39:25,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 09:39:25,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 09:39:25,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 09:39:25,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 09:39:25,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 09:39:25,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 09:39:25,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 09:39:25,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 09:39:25,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 09:39:25,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 09:39:25,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 09:39:25,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 09:39:25,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 09:39:25,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 09:39:25,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 09:39:25,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 09:39:25,842 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 09:39:25,843 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 09:39:25,843 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 09:39:25,843 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 09:39:25,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 09:39:25,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 09:39:25,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 09:39:25,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 09:39:25,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 09:39:25,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 09:39:25,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 09:39:25,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 09:39:25,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 09:39:25,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 09:39:25,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 09:39:25,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 09:39:25,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:39:25,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 09:39:25,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 09:39:25,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 09:39:25,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 09:39:25,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 09:39:25,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 09:39:25,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 09:39:25,849 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 09:39:25,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 09:39:25,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 09:39:25,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 09:39:25,938 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 09:39:25,938 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 09:39:25,939 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-10-23 09:39:26,000 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b15dc3670/96869cdaffbb4ec898c1817a0c179dad/FLAGc6641337b [2018-10-23 09:39:26,476 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 09:39:26,477 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-10-23 09:39:26,491 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b15dc3670/96869cdaffbb4ec898c1817a0c179dad/FLAGc6641337b [2018-10-23 09:39:26,513 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b15dc3670/96869cdaffbb4ec898c1817a0c179dad [2018-10-23 09:39:26,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 09:39:26,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 09:39:26,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:26,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 09:39:26,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 09:39:26,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:26" (1/1) ... [2018-10-23 09:39:26,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9d0a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:26, skipping insertion in model container [2018-10-23 09:39:26,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:26" (1/1) ... [2018-10-23 09:39:26,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 09:39:26,603 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 09:39:26,905 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:26,916 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 09:39:26,994 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:27,019 INFO L193 MainTranslator]: Completed translation [2018-10-23 09:39:27,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27 WrapperNode [2018-10-23 09:39:27,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:27,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:27,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 09:39:27,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 09:39:27,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:27,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 09:39:27,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 09:39:27,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 09:39:27,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... [2018-10-23 09:39:27,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 09:39:27,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 09:39:27,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 09:39:27,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 09:39:27,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 09:39:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 09:39:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 09:39:27,985 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 09:39:27,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:27 BoogieIcfgContainer [2018-10-23 09:39:27,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 09:39:27,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 09:39:27,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 09:39:27,992 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 09:39:27,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:39:26" (1/3) ... [2018-10-23 09:39:27,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad5d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:27, skipping insertion in model container [2018-10-23 09:39:27,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:27" (2/3) ... [2018-10-23 09:39:27,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad5d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:27, skipping insertion in model container [2018-10-23 09:39:27,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:27" (3/3) ... [2018-10-23 09:39:27,996 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-10-23 09:39:28,007 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 09:39:28,017 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-10-23 09:39:28,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-10-23 09:39:28,083 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 09:39:28,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 09:39:28,084 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 09:39:28,084 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 09:39:28,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 09:39:28,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 09:39:28,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 09:39:28,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 09:39:28,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 09:39:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-23 09:39:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 09:39:28,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:28,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:28,125 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:28,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2018-10-23 09:39:28,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:28,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:28,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:28,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:28,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 09:39:28,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 09:39:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 09:39:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:39:28,326 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-10-23 09:39:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:28,367 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2018-10-23 09:39:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 09:39:28,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-23 09:39:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:28,381 INFO L225 Difference]: With dead ends: 88 [2018-10-23 09:39:28,381 INFO L226 Difference]: Without dead ends: 76 [2018-10-23 09:39:28,385 INFO L605 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 [2018-10-23 09:39:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-23 09:39:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-23 09:39:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-23 09:39:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-10-23 09:39:28,426 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2018-10-23 09:39:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:28,426 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-10-23 09:39:28,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 09:39:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-10-23 09:39:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 09:39:28,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:28,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:28,429 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:28,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2018-10-23 09:39:28,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:28,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:28,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:28,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:28,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:28,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:28,615 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-10-23 09:39:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:28,822 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-10-23 09:39:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:28,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-23 09:39:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:28,825 INFO L225 Difference]: With dead ends: 76 [2018-10-23 09:39:28,825 INFO L226 Difference]: Without dead ends: 74 [2018-10-23 09:39:28,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-23 09:39:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-23 09:39:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-23 09:39:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-10-23 09:39:28,837 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2018-10-23 09:39:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:28,837 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-10-23 09:39:28,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-10-23 09:39:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 09:39:28,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:28,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:28,839 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:28,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2018-10-23 09:39:28,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:28,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:28,955 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-10-23 09:39:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:29,316 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-10-23 09:39:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:29,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-23 09:39:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:29,322 INFO L225 Difference]: With dead ends: 112 [2018-10-23 09:39:29,322 INFO L226 Difference]: Without dead ends: 110 [2018-10-23 09:39:29,323 INFO L605 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 [2018-10-23 09:39:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-23 09:39:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2018-10-23 09:39:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-23 09:39:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-10-23 09:39:29,340 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2018-10-23 09:39:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:29,340 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-10-23 09:39:29,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-10-23 09:39:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-23 09:39:29,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:29,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:29,345 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:29,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2018-10-23 09:39:29,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:29,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:29,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:29,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:29,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:29,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:29,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:29,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:29,584 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-10-23 09:39:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:29,958 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-10-23 09:39:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:29,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-10-23 09:39:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:29,960 INFO L225 Difference]: With dead ends: 72 [2018-10-23 09:39:29,961 INFO L226 Difference]: Without dead ends: 70 [2018-10-23 09:39:29,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-23 09:39:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-23 09:39:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-23 09:39:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-10-23 09:39:29,969 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2018-10-23 09:39:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:29,970 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-10-23 09:39:29,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-10-23 09:39:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-23 09:39:29,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:29,971 INFO L375 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] [2018-10-23 09:39:29,972 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:29,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:29,972 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2018-10-23 09:39:29,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:29,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:29,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:29,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:29,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:30,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:30,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:30,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:30,069 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-10-23 09:39:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:30,570 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-10-23 09:39:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:30,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-23 09:39:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:30,572 INFO L225 Difference]: With dead ends: 137 [2018-10-23 09:39:30,573 INFO L226 Difference]: Without dead ends: 135 [2018-10-23 09:39:30,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-23 09:39:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-10-23 09:39:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-23 09:39:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-10-23 09:39:30,594 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2018-10-23 09:39:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:30,597 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-10-23 09:39:30,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-10-23 09:39:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-23 09:39:30,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:30,598 INFO L375 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] [2018-10-23 09:39:30,599 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:30,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2018-10-23 09:39:30,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:30,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:30,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:30,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:30,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:30,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:30,717 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2018-10-23 09:39:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:30,931 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-10-23 09:39:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:30,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-23 09:39:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:30,934 INFO L225 Difference]: With dead ends: 104 [2018-10-23 09:39:30,934 INFO L226 Difference]: Without dead ends: 102 [2018-10-23 09:39:30,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-23 09:39:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2018-10-23 09:39:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-23 09:39:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-10-23 09:39:30,954 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2018-10-23 09:39:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:30,954 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-10-23 09:39:30,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-10-23 09:39:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 09:39:30,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:30,955 INFO L375 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] [2018-10-23 09:39:30,959 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:30,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2018-10-23 09:39:30,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:30,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:30,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:30,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:30,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:31,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:31,075 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-10-23 09:39:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:31,238 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-10-23 09:39:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 09:39:31,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-23 09:39:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:31,239 INFO L225 Difference]: With dead ends: 117 [2018-10-23 09:39:31,239 INFO L226 Difference]: Without dead ends: 115 [2018-10-23 09:39:31,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-23 09:39:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2018-10-23 09:39:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-23 09:39:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-10-23 09:39:31,249 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2018-10-23 09:39:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:31,249 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-10-23 09:39:31,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-10-23 09:39:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 09:39:31,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:31,251 INFO L375 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] [2018-10-23 09:39:31,252 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:31,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2018-10-23 09:39:31,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:31,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:31,435 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 09:39:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:31,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:31,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:31,447 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2018-10-23 09:39:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:31,571 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-10-23 09:39:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 09:39:31,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-23 09:39:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:31,573 INFO L225 Difference]: With dead ends: 73 [2018-10-23 09:39:31,573 INFO L226 Difference]: Without dead ends: 71 [2018-10-23 09:39:31,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-23 09:39:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-23 09:39:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-23 09:39:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-10-23 09:39:31,582 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2018-10-23 09:39:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:31,582 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-10-23 09:39:31,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-10-23 09:39:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-23 09:39:31,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:31,583 INFO L375 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] [2018-10-23 09:39:31,584 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:31,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2018-10-23 09:39:31,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:31,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:31,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:31,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 09:39:31,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 09:39:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 09:39:31,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:39:31,625 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2018-10-23 09:39:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:31,711 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-10-23 09:39:31,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 09:39:31,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-23 09:39:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:31,713 INFO L225 Difference]: With dead ends: 111 [2018-10-23 09:39:31,713 INFO L226 Difference]: Without dead ends: 71 [2018-10-23 09:39:31,714 INFO L605 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 [2018-10-23 09:39:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-23 09:39:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-23 09:39:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-23 09:39:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-10-23 09:39:31,720 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2018-10-23 09:39:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:31,721 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-10-23 09:39:31,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 09:39:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-10-23 09:39:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-23 09:39:31,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:31,723 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:31,724 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:31,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2018-10-23 09:39:31,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:31,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 09:39:31,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 09:39:31,846 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 09:39:31,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:31,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 09:39:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 09:39:32,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 09:39:32,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-23 09:39:32,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:32,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:32,030 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 9 states. [2018-10-23 09:39:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:32,328 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-10-23 09:39:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:32,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-10-23 09:39:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:32,329 INFO L225 Difference]: With dead ends: 111 [2018-10-23 09:39:32,329 INFO L226 Difference]: Without dead ends: 109 [2018-10-23 09:39:32,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-23 09:39:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-23 09:39:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2018-10-23 09:39:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-23 09:39:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-10-23 09:39:32,338 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2018-10-23 09:39:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:32,338 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-10-23 09:39:32,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-10-23 09:39:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-23 09:39:32,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:32,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:32,340 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:32,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2018-10-23 09:39:32,341 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:32,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:32,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:32,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:32,484 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2018-10-23 09:39:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:32,704 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-10-23 09:39:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:32,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-23 09:39:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:32,706 INFO L225 Difference]: With dead ends: 69 [2018-10-23 09:39:32,706 INFO L226 Difference]: Without dead ends: 67 [2018-10-23 09:39:32,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-23 09:39:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-23 09:39:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-23 09:39:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-10-23 09:39:32,713 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-10-23 09:39:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:32,713 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-10-23 09:39:32,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-10-23 09:39:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-23 09:39:32,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:32,715 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:32,716 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:32,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2018-10-23 09:39:32,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:32,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:32,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 09:39:32,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 09:39:32,848 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 09:39:32,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:32,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 09:39:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 09:39:33,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 09:39:33,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-23 09:39:33,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:33,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:33,030 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2018-10-23 09:39:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:33,214 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-10-23 09:39:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:33,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-10-23 09:39:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:33,216 INFO L225 Difference]: With dead ends: 67 [2018-10-23 09:39:33,216 INFO L226 Difference]: Without dead ends: 65 [2018-10-23 09:39:33,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-23 09:39:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-23 09:39:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-10-23 09:39:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-23 09:39:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-10-23 09:39:33,222 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2018-10-23 09:39:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:33,222 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-10-23 09:39:33,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-10-23 09:39:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-23 09:39:33,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:33,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:33,224 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:33,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2018-10-23 09:39:33,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:33,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:33,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:33,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:33,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:33,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:33,364 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-10-23 09:39:33,476 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 09:39:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:33,585 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-10-23 09:39:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:33,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-23 09:39:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:33,586 INFO L225 Difference]: With dead ends: 60 [2018-10-23 09:39:33,586 INFO L226 Difference]: Without dead ends: 58 [2018-10-23 09:39:33,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-23 09:39:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-23 09:39:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-23 09:39:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-10-23 09:39:33,592 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2018-10-23 09:39:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:33,593 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-10-23 09:39:33,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-10-23 09:39:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-23 09:39:33,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:33,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:33,595 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:33,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2018-10-23 09:39:33,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:33,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:33,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:33,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:33,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:33,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:33,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:33,717 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2018-10-23 09:39:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:34,041 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-10-23 09:39:34,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:34,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-23 09:39:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:34,042 INFO L225 Difference]: With dead ends: 59 [2018-10-23 09:39:34,042 INFO L226 Difference]: Without dead ends: 57 [2018-10-23 09:39:34,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-23 09:39:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-23 09:39:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-23 09:39:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-10-23 09:39:34,047 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2018-10-23 09:39:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:34,047 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-10-23 09:39:34,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-10-23 09:39:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-23 09:39:34,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:34,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:34,049 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:34,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2018-10-23 09:39:34,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:34,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:34,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:34,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:34,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:34,356 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-10-23 09:39:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:34,687 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-10-23 09:39:34,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:34,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-23 09:39:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:34,689 INFO L225 Difference]: With dead ends: 67 [2018-10-23 09:39:34,689 INFO L226 Difference]: Without dead ends: 65 [2018-10-23 09:39:34,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-23 09:39:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-10-23 09:39:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-23 09:39:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-10-23 09:39:34,694 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2018-10-23 09:39:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:34,695 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-10-23 09:39:34,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-10-23 09:39:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-23 09:39:34,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:34,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:34,697 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:34,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2018-10-23 09:39:34,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:34,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:34,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:34,789 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 6 states. [2018-10-23 09:39:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:34,938 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-10-23 09:39:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:34,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-10-23 09:39:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:34,939 INFO L225 Difference]: With dead ends: 87 [2018-10-23 09:39:34,940 INFO L226 Difference]: Without dead ends: 85 [2018-10-23 09:39:34,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-23 09:39:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-10-23 09:39:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-23 09:39:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-10-23 09:39:34,946 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2018-10-23 09:39:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:34,946 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-10-23 09:39:34,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-10-23 09:39:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-23 09:39:34,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:34,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:34,948 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:34,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2018-10-23 09:39:34,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:34,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:35,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:35,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:35,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:35,375 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-10-23 09:39:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:35,785 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-10-23 09:39:35,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:35,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-10-23 09:39:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:35,786 INFO L225 Difference]: With dead ends: 57 [2018-10-23 09:39:35,786 INFO L226 Difference]: Without dead ends: 55 [2018-10-23 09:39:35,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-23 09:39:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-23 09:39:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-23 09:39:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-23 09:39:35,792 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2018-10-23 09:39:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:35,792 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-23 09:39:35,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-10-23 09:39:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-23 09:39:35,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:35,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:35,794 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:35,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2018-10-23 09:39:35,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:35,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:35,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:35,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:35,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:35,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:35,961 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-10-23 09:39:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:36,146 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-10-23 09:39:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:36,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-23 09:39:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:36,153 INFO L225 Difference]: With dead ends: 66 [2018-10-23 09:39:36,153 INFO L226 Difference]: Without dead ends: 64 [2018-10-23 09:39:36,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-23 09:39:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-10-23 09:39:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-23 09:39:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-10-23 09:39:36,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2018-10-23 09:39:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:36,159 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-10-23 09:39:36,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-10-23 09:39:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-23 09:39:36,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:36,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:36,161 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:36,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2018-10-23 09:39:36,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:36,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:36,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:36,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:36,286 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2018-10-23 09:39:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:36,458 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-10-23 09:39:36,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:36,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-10-23 09:39:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:36,460 INFO L225 Difference]: With dead ends: 62 [2018-10-23 09:39:36,460 INFO L226 Difference]: Without dead ends: 60 [2018-10-23 09:39:36,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-23 09:39:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-10-23 09:39:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-23 09:39:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-10-23 09:39:36,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2018-10-23 09:39:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:36,467 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-10-23 09:39:36,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-10-23 09:39:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-23 09:39:36,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:36,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:36,468 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:36,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2018-10-23 09:39:36,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:36,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:36,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:36,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:36,607 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2018-10-23 09:39:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:36,755 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-10-23 09:39:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:36,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-23 09:39:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:36,756 INFO L225 Difference]: With dead ends: 84 [2018-10-23 09:39:36,757 INFO L226 Difference]: Without dead ends: 82 [2018-10-23 09:39:36,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-23 09:39:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2018-10-23 09:39:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-23 09:39:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-10-23 09:39:36,764 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2018-10-23 09:39:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:36,765 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-10-23 09:39:36,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-10-23 09:39:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-23 09:39:36,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:36,766 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:36,766 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:36,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2018-10-23 09:39:36,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:36,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:36,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:36,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:36,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:36,892 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-10-23 09:39:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:37,057 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-10-23 09:39:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:37,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-23 09:39:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:37,058 INFO L225 Difference]: With dead ends: 69 [2018-10-23 09:39:37,058 INFO L226 Difference]: Without dead ends: 67 [2018-10-23 09:39:37,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-23 09:39:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-10-23 09:39:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-23 09:39:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-10-23 09:39:37,068 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2018-10-23 09:39:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:37,068 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-10-23 09:39:37,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-10-23 09:39:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-23 09:39:37,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:37,069 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:37,070 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:37,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:37,071 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2018-10-23 09:39:37,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:37,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:37,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:37,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:37,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 09:39:37,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 09:39:37,217 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 09:39:37,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:37,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 09:39:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:37,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 09:39:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-23 09:39:37,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:37,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:37,375 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2018-10-23 09:39:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:37,539 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-10-23 09:39:37,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:37,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-10-23 09:39:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:37,543 INFO L225 Difference]: With dead ends: 54 [2018-10-23 09:39:37,543 INFO L226 Difference]: Without dead ends: 52 [2018-10-23 09:39:37,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-23 09:39:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-23 09:39:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-23 09:39:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-23 09:39:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-10-23 09:39:37,549 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2018-10-23 09:39:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:37,550 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-10-23 09:39:37,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-10-23 09:39:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-23 09:39:37,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:37,551 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:37,551 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:37,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2018-10-23 09:39:37,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:37,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:37,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:37,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:37,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:37,741 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 09:39:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 09:39:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:37,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:37,772 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-10-23 09:39:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:38,021 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-10-23 09:39:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:38,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-10-23 09:39:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:38,022 INFO L225 Difference]: With dead ends: 71 [2018-10-23 09:39:38,022 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 09:39:38,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 09:39:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 09:39:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 09:39:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 09:39:38,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-10-23 09:39:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:38,025 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 09:39:38,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 09:39:38,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 09:39:38,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 09:39:38,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 09:39:38,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 09:39:39,128 WARN L179 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-10-23 09:39:39,582 WARN L179 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-10-23 09:39:39,866 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-10-23 09:39:40,453 WARN L179 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2018-10-23 09:39:40,499 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 09:39:40,500 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-10-23 09:39:40,501 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-10-23 09:39:40,501 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-10-23 09:39:40,501 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-10-23 09:39:40,501 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-10-23 09:39:40,501 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-10-23 09:39:40,501 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-10-23 09:39:40,502 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-23 09:39:40,503 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-10-23 09:39:40,504 INFO L421 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)) .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (<= 1 ULTIMATE.start_main_~main__cp~0) (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2018-10-23 09:39:40,504 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-10-23 09:39:40,504 INFO L425 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-10-23 09:39:40,504 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-10-23 09:39:40,504 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-10-23 09:39:40,505 INFO L421 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse1 (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (<= 2 ULTIMATE.start_main_~main__cp~0) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse1 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2) (and .cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0))))) [2018-10-23 09:39:40,505 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-10-23 09:39:40,505 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 09:39:40,505 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-10-23 09:39:40,505 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-10-23 09:39:40,505 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L421 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-10-23 09:39:40,506 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-10-23 09:39:40,507 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-10-23 09:39:40,508 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 09:39:40,508 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-10-23 09:39:40,508 INFO L421 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~main__cp~0 1))) (let ((.cse2 (<= 2 ULTIMATE.start_main_~main__cp~0)) (.cse5 (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= 1 ULTIMATE.start_main_~main__cp~0) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3) (<= .cse7 ULTIMATE.start_main_~main__urilen~0)))))) (.cse1 (= ULTIMATE.start_main_~main__c~0 0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2 .cse3 .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0))))) (and .cse2 .cse5 .cse1 (< .cse7 ULTIMATE.start_main_~main__urilen~0) .cse6)))) [2018-10-23 09:39:40,508 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-10-23 09:39:40,508 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L428 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-10-23 09:39:40,509 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 09:39:40,510 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-10-23 09:39:40,510 INFO L421 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (< 0 ULTIMATE.start_main_~main__scheme~0))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) [2018-10-23 09:39:40,510 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-10-23 09:39:40,510 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-10-23 09:39:40,510 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-10-23 09:39:40,510 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-10-23 09:39:40,510 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-10-23 09:39:40,511 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-10-23 09:39:40,511 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-10-23 09:39:40,511 INFO L425 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-10-23 09:39:40,511 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-10-23 09:39:40,511 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-10-23 09:39:40,511 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-10-23 09:39:40,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:39:40 BoogieIcfgContainer [2018-10-23 09:39:40,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 09:39:40,541 INFO L168 Benchmark]: Toolchain (without parser) took 14014.26 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 875.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.5 MB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:40,542 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:40,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:40,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:40,544 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:40,544 INFO L168 Benchmark]: RCFGBuilder took 893.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:40,545 INFO L168 Benchmark]: TraceAbstraction took 12552.59 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.1 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.8 MB). Peak memory consumption was 249.9 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:40,550 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 491.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 893.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12552.59 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.1 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.8 MB). Peak memory consumption was 249.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))) && 1 <= main__cp) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 1 == __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && ((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c) || (((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && (((((1 == __VERIFIER_assert__cond && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) || (((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (1 == __VERIFIER_assert__cond && ((((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && ((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c))) || ((((2 <= main__cp && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. SAFE Result, 12.4s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 2836 SDslu, 1555 SDs, 0 SdLazy, 1119 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 23 MinimizatonAttempts, 315 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 742 HoareAnnotationTreeSize, 6 FomulaSimplifications, 239048 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 147118 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 48258 SizeOfPredicates, 21 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 10/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...