java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:55:09,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:55:09,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:55:09,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:55:09,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:55:09,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:55:09,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:55:09,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:55:09,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:55:09,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:55:09,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:55:09,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:55:09,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:55:09,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:55:09,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:55:09,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:55:09,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:55:09,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:55:09,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:55:09,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:55:09,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:55:09,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:55:09,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:55:09,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:55:09,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:55:09,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:55:09,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:55:09,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:55:09,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:55:09,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:55:09,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:55:09,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:55:09,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:55:09,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:55:09,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:55:09,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:55:09,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:55:09,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:55:09,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:55:09,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:55:09,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:55:09,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:55:09,376 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:55:09,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:55:09,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:55:09,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:55:09,377 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:55:09,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:55:09,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:55:09,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:55:09,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:55:09,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:55:09,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:55:09,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:55:09,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:55:09,379 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:55:09,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:55:09,380 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:55:09,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:55:09,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:55:09,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:55:09,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:55:09,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:55:09,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:55:09,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:55:09,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:55:09,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:55:09,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:55:09,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:55:09,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:55:09,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:55:09,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:55:09,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:55:09,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:55:09,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:55:09,436 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:55:09,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-09-08 02:55:09,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7e45e8c/fbbd3ed873b74d11b52177d4eda8f65e/FLAGde55692a3 [2019-09-08 02:55:09,914 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:55:09,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-09-08 02:55:09,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7e45e8c/fbbd3ed873b74d11b52177d4eda8f65e/FLAGde55692a3 [2019-09-08 02:55:10,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7e45e8c/fbbd3ed873b74d11b52177d4eda8f65e [2019-09-08 02:55:10,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:55:10,323 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:55:10,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:55:10,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:55:10,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:55:10,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad267df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10, skipping insertion in model container [2019-09-08 02:55:10,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,338 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:55:10,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:55:10,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:55:10,687 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:55:10,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:55:10,875 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:55:10,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10 WrapperNode [2019-09-08 02:55:10,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:55:10,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:55:10,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:55:10,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:55:10,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... [2019-09-08 02:55:10,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:55:10,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:55:10,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:55:10,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:55:10,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:55:11,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:55:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:55:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:55:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:55:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:55:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:55:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:55:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:55:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:55:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:55:11,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:55:11,765 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 02:55:11,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:55:11 BoogieIcfgContainer [2019-09-08 02:55:11,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:55:11,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:55:11,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:55:11,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:55:11,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:55:10" (1/3) ... [2019-09-08 02:55:11,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bbd116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:55:11, skipping insertion in model container [2019-09-08 02:55:11,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:10" (2/3) ... [2019-09-08 02:55:11,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bbd116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:55:11, skipping insertion in model container [2019-09-08 02:55:11,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:55:11" (3/3) ... [2019-09-08 02:55:11,775 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-09-08 02:55:11,785 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:55:11,795 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 02:55:11,810 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 02:55:11,840 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:55:11,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:55:11,840 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:55:11,841 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:55:11,841 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:55:11,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:55:11,842 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:55:11,842 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:55:11,842 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:55:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-09-08 02:55:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 02:55:11,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:11,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:11,871 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-09-08 02:55:11,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:11,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:11,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:11,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:12,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:12,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:12,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:12,056 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-09-08 02:55:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:12,413 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2019-09-08 02:55:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:12,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-08 02:55:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:12,427 INFO L225 Difference]: With dead ends: 135 [2019-09-08 02:55:12,427 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 02:55:12,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 02:55:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-08 02:55:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 02:55:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-09-08 02:55:12,478 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-09-08 02:55:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:12,478 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-09-08 02:55:12,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-09-08 02:55:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:55:12,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:12,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:12,480 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-09-08 02:55:12,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:12,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:12,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:12,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:12,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:12,541 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states. [2019-09-08 02:55:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:12,714 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2019-09-08 02:55:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:12,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 02:55:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:12,718 INFO L225 Difference]: With dead ends: 118 [2019-09-08 02:55:12,718 INFO L226 Difference]: Without dead ends: 113 [2019-09-08 02:55:12,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-08 02:55:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-08 02:55:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 02:55:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-09-08 02:55:12,741 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-09-08 02:55:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:12,741 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-09-08 02:55:12,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-09-08 02:55:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:55:12,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:12,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:12,743 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-09-08 02:55:12,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:12,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:12,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:12,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:12,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:12,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:12,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:12,853 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states. [2019-09-08 02:55:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:13,074 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-08 02:55:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:13,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-08 02:55:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:13,078 INFO L225 Difference]: With dead ends: 113 [2019-09-08 02:55:13,078 INFO L226 Difference]: Without dead ends: 111 [2019-09-08 02:55:13,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-08 02:55:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-08 02:55:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 02:55:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-09-08 02:55:13,096 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-09-08 02:55:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:13,096 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-09-08 02:55:13,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-09-08 02:55:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:55:13,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:13,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:13,100 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-09-08 02:55:13,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:13,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:13,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:13,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:13,174 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2019-09-08 02:55:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:13,316 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-09-08 02:55:13,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:13,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-08 02:55:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:13,319 INFO L225 Difference]: With dead ends: 111 [2019-09-08 02:55:13,320 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 02:55:13,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 02:55:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-08 02:55:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 02:55:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-09-08 02:55:13,337 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-09-08 02:55:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:13,337 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-09-08 02:55:13,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-09-08 02:55:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:55:13,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:13,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:13,343 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-09-08 02:55:13,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:13,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:13,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:13,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:13,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:13,422 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states. [2019-09-08 02:55:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:13,655 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-09-08 02:55:13,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:13,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:55:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:13,656 INFO L225 Difference]: With dead ends: 125 [2019-09-08 02:55:13,657 INFO L226 Difference]: Without dead ends: 123 [2019-09-08 02:55:13,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-08 02:55:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-09-08 02:55:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-08 02:55:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-09-08 02:55:13,664 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-09-08 02:55:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:13,665 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-09-08 02:55:13,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-09-08 02:55:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:55:13,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:13,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:13,667 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-09-08 02:55:13,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:13,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:13,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:13,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:13,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:13,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:13,711 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states. [2019-09-08 02:55:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:13,911 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-09-08 02:55:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:13,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:55:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:13,913 INFO L225 Difference]: With dead ends: 105 [2019-09-08 02:55:13,913 INFO L226 Difference]: Without dead ends: 103 [2019-09-08 02:55:13,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-08 02:55:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-08 02:55:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 02:55:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-09-08 02:55:13,920 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-09-08 02:55:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:13,920 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-09-08 02:55:13,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-09-08 02:55:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:13,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:13,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:13,922 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:13,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-09-08 02:55:13,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:13,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:13,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:13,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:13,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:13,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:13,982 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-09-08 02:55:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:14,170 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-08 02:55:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:14,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:14,178 INFO L225 Difference]: With dead ends: 120 [2019-09-08 02:55:14,178 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 02:55:14,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 02:55:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-09-08 02:55:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 02:55:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-09-08 02:55:14,184 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-09-08 02:55:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:14,187 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-09-08 02:55:14,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-09-08 02:55:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:14,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:14,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:14,189 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-09-08 02:55:14,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:14,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:14,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:14,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:14,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:14,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:14,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:14,225 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2019-09-08 02:55:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:14,414 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-08 02:55:14,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:14,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:14,416 INFO L225 Difference]: With dead ends: 120 [2019-09-08 02:55:14,416 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 02:55:14,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 02:55:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-09-08 02:55:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 02:55:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-08 02:55:14,422 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-09-08 02:55:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:14,422 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-08 02:55:14,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-08 02:55:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:14,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:14,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:14,424 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-09-08 02:55:14,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:14,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:14,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:14,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:14,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:14,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:14,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:14,482 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-09-08 02:55:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:14,690 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-09-08 02:55:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:14,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:14,692 INFO L225 Difference]: With dead ends: 99 [2019-09-08 02:55:14,693 INFO L226 Difference]: Without dead ends: 95 [2019-09-08 02:55:14,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-08 02:55:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-08 02:55:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 02:55:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-08 02:55:14,699 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-09-08 02:55:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:14,699 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-08 02:55:14,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-08 02:55:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:55:14,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:14,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:14,701 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:14,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-09-08 02:55:14,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:14,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:14,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:14,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:14,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:14,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:14,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:14,819 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-09-08 02:55:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:15,061 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2019-09-08 02:55:15,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:15,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-08 02:55:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:15,064 INFO L225 Difference]: With dead ends: 111 [2019-09-08 02:55:15,065 INFO L226 Difference]: Without dead ends: 109 [2019-09-08 02:55:15,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-08 02:55:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-09-08 02:55:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 02:55:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-09-08 02:55:15,069 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-09-08 02:55:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:15,069 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-09-08 02:55:15,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-09-08 02:55:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:55:15,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:15,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:15,071 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:15,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-09-08 02:55:15,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:15,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:15,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:15,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:15,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:15,128 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2019-09-08 02:55:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:15,202 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2019-09-08 02:55:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:15,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-08 02:55:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:15,204 INFO L225 Difference]: With dead ends: 93 [2019-09-08 02:55:15,204 INFO L226 Difference]: Without dead ends: 91 [2019-09-08 02:55:15,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-08 02:55:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-08 02:55:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-08 02:55:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-09-08 02:55:15,211 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-09-08 02:55:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:15,212 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-09-08 02:55:15,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-09-08 02:55:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:55:15,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:15,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:15,213 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-09-08 02:55:15,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:15,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:15,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:15,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:15,252 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states. [2019-09-08 02:55:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:15,371 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-09-08 02:55:15,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:15,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-08 02:55:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:15,373 INFO L225 Difference]: With dead ends: 91 [2019-09-08 02:55:15,373 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 02:55:15,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 02:55:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-08 02:55:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 02:55:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-08 02:55:15,377 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-09-08 02:55:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:15,377 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-08 02:55:15,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-08 02:55:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:55:15,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:15,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:15,379 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-09-08 02:55:15,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:15,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:15,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:15,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 02:55:15,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:55:15,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:55:15,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:55:15,512 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2019-09-08 02:55:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:15,658 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-08 02:55:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:55:15,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-08 02:55:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:15,660 INFO L225 Difference]: With dead ends: 67 [2019-09-08 02:55:15,660 INFO L226 Difference]: Without dead ends: 65 [2019-09-08 02:55:15,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:55:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-08 02:55:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-09-08 02:55:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 02:55:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-08 02:55:15,665 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-09-08 02:55:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:15,666 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-08 02:55:15,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:55:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-08 02:55:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 02:55:15,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:15,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:15,672 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-09-08 02:55:15,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:15,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:15,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:15,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 02:55:15,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 02:55:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 02:55:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-08 02:55:15,843 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-09-08 02:55:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:15,978 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-08 02:55:15,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:55:15,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-08 02:55:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:15,983 INFO L225 Difference]: With dead ends: 56 [2019-09-08 02:55:15,983 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 02:55:15,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:55:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 02:55:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-08 02:55:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 02:55:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-08 02:55:15,987 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-09-08 02:55:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:15,988 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-08 02:55:15,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 02:55:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-08 02:55:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:55:15,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:15,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:15,994 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:15,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:15,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-09-08 02:55:15,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:15,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:16,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:16,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:16,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:16,259 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2019-09-08 02:55:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:16,361 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-08 02:55:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:16,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-08 02:55:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:16,362 INFO L225 Difference]: With dead ends: 62 [2019-09-08 02:55:16,362 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 02:55:16,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 02:55:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-08 02:55:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 02:55:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-08 02:55:16,367 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-09-08 02:55:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:16,367 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-08 02:55:16,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-08 02:55:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:55:16,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:16,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:16,369 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-09-08 02:55:16,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:16,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:16,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:16,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:16,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:16,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:16,566 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-09-08 02:55:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:16,653 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-08 02:55:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:16,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-08 02:55:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:16,654 INFO L225 Difference]: With dead ends: 52 [2019-09-08 02:55:16,654 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:55:16,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:55:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:55:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:55:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:55:16,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-08 02:55:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:16,656 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:55:16,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:55:16,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:55:16,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:55:16,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:55:16,778 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:55:16,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:55:16,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:55:16,779 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:55:16,779 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:55:16,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:55:16,779 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-09-08 02:55:16,779 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-09-08 02:55:16,779 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-09-08 02:55:16,780 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-09-08 02:55:16,781 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-09-08 02:55:16,781 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-09-08 02:55:16,781 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-08 02:55:16,781 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-09-08 02:55:16,781 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-09-08 02:55:16,781 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-09-08 02:55:16,782 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-09-08 02:55:16,782 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-09-08 02:55:16,782 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-09-08 02:55:16,782 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-09-08 02:55:16,782 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2019-09-08 02:55:16,782 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-09-08 02:55:16,783 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-09-08 02:55:16,784 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-09-08 02:55:16,784 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-09-08 02:55:16,784 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-09-08 02:55:16,784 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-09-08 02:55:16,784 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-09-08 02:55:16,784 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-09-08 02:55:16,785 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-09-08 02:55:16,786 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-09-08 02:55:16,786 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-09-08 02:55:16,786 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-09-08 02:55:16,786 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-09-08 02:55:16,786 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-09-08 02:55:16,786 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-09-08 02:55:16,787 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-09-08 02:55:16,788 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-09-08 02:55:16,789 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-09-08 02:55:16,790 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-09-08 02:55:16,790 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-09-08 02:55:16,790 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-09-08 02:55:16,790 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-09-08 02:55:16,790 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 1 main_~main__t~0)) [2019-09-08 02:55:16,790 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-09-08 02:55:16,790 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-09-08 02:55:16,791 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-08 02:55:16,792 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-09-08 02:55:16,793 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-09-08 02:55:16,794 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-09-08 02:55:16,795 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-09-08 02:55:16,796 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-09-08 02:55:16,796 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-09-08 02:55:16,796 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-09-08 02:55:16,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:55:16 BoogieIcfgContainer [2019-09-08 02:55:16,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:55:16,814 INFO L168 Benchmark]: Toolchain (without parser) took 6491.00 ms. Allocated memory was 135.8 MB in the beginning and 292.0 MB in the end (delta: 156.2 MB). Free memory was 90.1 MB in the beginning and 90.0 MB in the end (delta: 127.6 kB). Peak memory consumption was 156.4 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:16,815 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:55:16,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.12 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 89.9 MB in the beginning and 174.0 MB in the end (delta: -84.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:16,817 INFO L168 Benchmark]: Boogie Preprocessor took 60.77 ms. Allocated memory is still 201.3 MB. Free memory was 174.0 MB in the beginning and 170.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:16,818 INFO L168 Benchmark]: RCFGBuilder took 828.28 ms. Allocated memory is still 201.3 MB. Free memory was 170.7 MB in the beginning and 123.3 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:16,819 INFO L168 Benchmark]: TraceAbstraction took 5044.73 ms. Allocated memory was 201.3 MB in the beginning and 292.0 MB in the end (delta: 90.7 MB). Free memory was 122.7 MB in the beginning and 90.0 MB in the end (delta: 32.7 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:16,823 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 553.12 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 89.9 MB in the beginning and 174.0 MB in the end (delta: -84.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.77 ms. Allocated memory is still 201.3 MB. Free memory was 174.0 MB in the beginning and 170.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.28 ms. Allocated memory is still 201.3 MB. Free memory was 170.7 MB in the beginning and 123.3 MB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5044.73 ms. Allocated memory was 201.3 MB in the beginning and 292.0 MB in the end (delta: 90.7 MB). Free memory was 122.7 MB in the beginning and 90.0 MB in the end (delta: 32.7 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: 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: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 4.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 1886 SDslu, 912 SDs, 0 SdLazy, 2250 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 43 SyntacticMatches, 53 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 38 HoareAnnotationTreeSize, 9 FomulaSimplifications, 612 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 44554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...