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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:18:00,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:18:00,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:18:00,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:18:00,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:18:00,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:18:00,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:18:00,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:18:00,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:18:00,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:18:00,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:18:00,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:18:00,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:18:00,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:18:00,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:18:00,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:18:00,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:18:00,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:18:00,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:18:00,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:18:00,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:18:00,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:18:00,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:18:00,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:18:00,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:18:00,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:18:00,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:18:00,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:18:00,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:18:00,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:18:00,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:18:00,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:18:00,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:18:00,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:18:00,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:18:00,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:18:00,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:18:00,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:18:00,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:18:00,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:18:00,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:18:00,784 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-10-02 11:18:00,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:18:00,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:18:00,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:18:00,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:18:00,801 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:18:00,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:18:00,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:18:00,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:18:00,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:18:00,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:18:00,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:18:00,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:18:00,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:18:00,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:18:00,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:18:00,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:18:00,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:18:00,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:18:00,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:18:00,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:18:00,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:18:00,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:00,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:18:00,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:18:00,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:18:00,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:18:00,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:18:00,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:18:00,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:18:00,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:18:00,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:18:00,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:18:00,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:18:00,854 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:18:00,854 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+nlh-reducer.c [2019-10-02 11:18:00,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8173ff7/319c827d220b494d946c7efebe3d421d/FLAGdd89859c8 [2019-10-02 11:18:01,524 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:18:01,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-10-02 11:18:01,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8173ff7/319c827d220b494d946c7efebe3d421d/FLAGdd89859c8 [2019-10-02 11:18:01,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8173ff7/319c827d220b494d946c7efebe3d421d [2019-10-02 11:18:01,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:18:01,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:18:01,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:01,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:18:01,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:18:01,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:01" (1/1) ... [2019-10-02 11:18:01,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de83e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:01, skipping insertion in model container [2019-10-02 11:18:01,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:01" (1/1) ... [2019-10-02 11:18:01,822 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:18:01,903 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:18:02,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:02,658 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:18:02,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:02,849 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:18:02,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02 WrapperNode [2019-10-02 11:18:02,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:02,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:18:02,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:18:02,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:18:02,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... [2019-10-02 11:18:02,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:18:02,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:18:02,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:18:02,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:18:02,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:18:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:18:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:18:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:18:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:18:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:18:03,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:18:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:18:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:18:03,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:18:04,731 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:18:04,731 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:18:04,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:04 BoogieIcfgContainer [2019-10-02 11:18:04,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:18:04,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:18:04,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:18:04,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:18:04,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:18:01" (1/3) ... [2019-10-02 11:18:04,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e982da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:04, skipping insertion in model container [2019-10-02 11:18:04,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:02" (2/3) ... [2019-10-02 11:18:04,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e982da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:04, skipping insertion in model container [2019-10-02 11:18:04,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:04" (3/3) ... [2019-10-02 11:18:04,742 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-10-02 11:18:04,752 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:18:04,762 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-02 11:18:04,779 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-02 11:18:04,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:18:04,815 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:18:04,815 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:18:04,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:18:04,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:18:04,815 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:18:04,815 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:18:04,816 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:18:04,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:18:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-10-02 11:18:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-02 11:18:04,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:04,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:04,851 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2019-10-02 11:18:04,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:04,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:05,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:05,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:05,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:05,068 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2019-10-02 11:18:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,017 INFO L93 Difference]: Finished difference Result 319 states and 579 transitions. [2019-10-02 11:18:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:06,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-02 11:18:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,035 INFO L225 Difference]: With dead ends: 319 [2019-10-02 11:18:06,036 INFO L226 Difference]: Without dead ends: 302 [2019-10-02 11:18:06,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-02 11:18:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-10-02 11:18:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-02 11:18:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2019-10-02 11:18:06,142 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2019-10-02 11:18:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,142 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2019-10-02 11:18:06,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2019-10-02 11:18:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:18:06,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,144 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2019-10-02 11:18:06,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:06,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:06,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:06,217 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 4 states. [2019-10-02 11:18:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,704 INFO L93 Difference]: Finished difference Result 309 states and 432 transitions. [2019-10-02 11:18:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:06,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 11:18:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,709 INFO L225 Difference]: With dead ends: 309 [2019-10-02 11:18:06,709 INFO L226 Difference]: Without dead ends: 304 [2019-10-02 11:18:06,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-02 11:18:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-10-02 11:18:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-02 11:18:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-10-02 11:18:06,726 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-10-02 11:18:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,726 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-10-02 11:18:06,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-10-02 11:18:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:18:06,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,728 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2019-10-02 11:18:06,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:06,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:06,770 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-10-02 11:18:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,273 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2019-10-02 11:18:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:07,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 11:18:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,277 INFO L225 Difference]: With dead ends: 297 [2019-10-02 11:18:07,277 INFO L226 Difference]: Without dead ends: 295 [2019-10-02 11:18:07,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-02 11:18:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-02 11:18:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-02 11:18:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-10-02 11:18:07,290 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2019-10-02 11:18:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,290 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-10-02 11:18:07,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-10-02 11:18:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:18:07,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,292 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2019-10-02 11:18:07,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:07,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:07,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:07,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:07,337 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-10-02 11:18:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,653 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2019-10-02 11:18:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:07,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-02 11:18:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,656 INFO L225 Difference]: With dead ends: 300 [2019-10-02 11:18:07,656 INFO L226 Difference]: Without dead ends: 298 [2019-10-02 11:18:07,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-02 11:18:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-02 11:18:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-02 11:18:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-10-02 11:18:07,669 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2019-10-02 11:18:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,669 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-10-02 11:18:07,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-10-02 11:18:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:18:07,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,671 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2019-10-02 11:18:07,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:07,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,746 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 5 states. [2019-10-02 11:18:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,338 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2019-10-02 11:18:08,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:08,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-02 11:18:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,341 INFO L225 Difference]: With dead ends: 298 [2019-10-02 11:18:08,341 INFO L226 Difference]: Without dead ends: 296 [2019-10-02 11:18:08,342 INFO L640 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-10-02 11:18:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-02 11:18:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-10-02 11:18:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-02 11:18:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-10-02 11:18:08,351 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2019-10-02 11:18:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,352 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-10-02 11:18:08,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-10-02 11:18:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:18:08,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:08,353 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2019-10-02 11:18:08,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:08,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:08,399 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-10-02 11:18:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,767 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-10-02 11:18:08,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:08,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-02 11:18:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,770 INFO L225 Difference]: With dead ends: 296 [2019-10-02 11:18:08,770 INFO L226 Difference]: Without dead ends: 292 [2019-10-02 11:18:08,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-02 11:18:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-10-02 11:18:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-02 11:18:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-10-02 11:18:08,779 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2019-10-02 11:18:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,780 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-10-02 11:18:08,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-10-02 11:18:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:18:08,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:08,782 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2019-10-02 11:18:08,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:08,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:08,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:08,883 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 5 states. [2019-10-02 11:18:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:09,535 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2019-10-02 11:18:09,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:09,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:18:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:09,541 INFO L225 Difference]: With dead ends: 292 [2019-10-02 11:18:09,542 INFO L226 Difference]: Without dead ends: 290 [2019-10-02 11:18:09,544 INFO L640 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-10-02 11:18:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-02 11:18:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-10-02 11:18:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-02 11:18:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-10-02 11:18:09,565 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2019-10-02 11:18:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:09,565 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-10-02 11:18:09,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-10-02 11:18:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:18:09,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:09,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:09,567 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2019-10-02 11:18:09,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:09,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:09,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:09,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:09,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:09,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:09,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:09,643 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-10-02 11:18:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:10,213 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2019-10-02 11:18:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:10,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:18:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:10,216 INFO L225 Difference]: With dead ends: 307 [2019-10-02 11:18:10,217 INFO L226 Difference]: Without dead ends: 305 [2019-10-02 11:18:10,218 INFO L640 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-10-02 11:18:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-02 11:18:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2019-10-02 11:18:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-02 11:18:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2019-10-02 11:18:10,228 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2019-10-02 11:18:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:10,229 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2019-10-02 11:18:10,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2019-10-02 11:18:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:18:10,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:10,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:10,236 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2019-10-02 11:18:10,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:10,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:10,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:10,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:10,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:10,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:10,321 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 5 states. [2019-10-02 11:18:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:10,865 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2019-10-02 11:18:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:10,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:18:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:10,868 INFO L225 Difference]: With dead ends: 288 [2019-10-02 11:18:10,868 INFO L226 Difference]: Without dead ends: 286 [2019-10-02 11:18:10,869 INFO L640 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-10-02 11:18:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-02 11:18:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-10-02 11:18:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-02 11:18:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-10-02 11:18:10,878 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2019-10-02 11:18:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:10,879 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-10-02 11:18:10,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-10-02 11:18:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:10,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:10,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:10,880 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2019-10-02 11:18:10,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:10,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:10,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:10,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:10,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:10,924 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 5 states. [2019-10-02 11:18:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:11,469 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2019-10-02 11:18:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:11,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:11,472 INFO L225 Difference]: With dead ends: 306 [2019-10-02 11:18:11,473 INFO L226 Difference]: Without dead ends: 304 [2019-10-02 11:18:11,473 INFO L640 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-10-02 11:18:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-02 11:18:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2019-10-02 11:18:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-02 11:18:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-10-02 11:18:11,482 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2019-10-02 11:18:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:11,482 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-10-02 11:18:11,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-10-02 11:18:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:11,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:11,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:11,484 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:11,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2019-10-02 11:18:11,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:11,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:11,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:11,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:11,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:11,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:11,547 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 5 states. [2019-10-02 11:18:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:12,115 INFO L93 Difference]: Finished difference Result 295 states and 360 transitions. [2019-10-02 11:18:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:12,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:12,118 INFO L225 Difference]: With dead ends: 295 [2019-10-02 11:18:12,119 INFO L226 Difference]: Without dead ends: 293 [2019-10-02 11:18:12,119 INFO L640 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-10-02 11:18:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-02 11:18:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2019-10-02 11:18:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-02 11:18:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-10-02 11:18:12,127 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2019-10-02 11:18:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:12,128 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-10-02 11:18:12,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-10-02 11:18:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:12,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:12,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:12,129 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2019-10-02 11:18:12,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:12,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:12,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:12,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:12,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:12,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:12,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:12,206 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 5 states. [2019-10-02 11:18:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:12,837 INFO L93 Difference]: Finished difference Result 279 states and 342 transitions. [2019-10-02 11:18:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:12,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:12,840 INFO L225 Difference]: With dead ends: 279 [2019-10-02 11:18:12,841 INFO L226 Difference]: Without dead ends: 275 [2019-10-02 11:18:12,841 INFO L640 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-10-02 11:18:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-02 11:18:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-10-02 11:18:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-02 11:18:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-10-02 11:18:12,852 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2019-10-02 11:18:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:12,852 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-10-02 11:18:12,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-10-02 11:18:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:18:12,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:12,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:12,854 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2019-10-02 11:18:12,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:12,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:12,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:12,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:12,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:12,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:12,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:12,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:12,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:12,920 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 5 states. [2019-10-02 11:18:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:13,552 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2019-10-02 11:18:13,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:13,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-02 11:18:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:13,554 INFO L225 Difference]: With dead ends: 290 [2019-10-02 11:18:13,555 INFO L226 Difference]: Without dead ends: 288 [2019-10-02 11:18:13,555 INFO L640 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-10-02 11:18:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-02 11:18:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2019-10-02 11:18:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-02 11:18:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2019-10-02 11:18:13,564 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2019-10-02 11:18:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:13,564 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2019-10-02 11:18:13,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2019-10-02 11:18:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:18:13,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:13,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:13,566 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2019-10-02 11:18:13,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:13,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:13,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:13,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:18:13,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:18:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:18:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:13,646 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 6 states. [2019-10-02 11:18:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:14,276 INFO L93 Difference]: Finished difference Result 288 states and 353 transitions. [2019-10-02 11:18:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:14,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 11:18:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:14,280 INFO L225 Difference]: With dead ends: 288 [2019-10-02 11:18:14,280 INFO L226 Difference]: Without dead ends: 286 [2019-10-02 11:18:14,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-02 11:18:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 271. [2019-10-02 11:18:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-02 11:18:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-10-02 11:18:14,289 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2019-10-02 11:18:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:14,289 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-10-02 11:18:14,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:18:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-10-02 11:18:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:18:14,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:14,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:14,291 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2019-10-02 11:18:14,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:14,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:14,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:14,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:14,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:14,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:14,332 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 4 states. [2019-10-02 11:18:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:14,650 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2019-10-02 11:18:14,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:14,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-02 11:18:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:14,652 INFO L225 Difference]: With dead ends: 274 [2019-10-02 11:18:14,652 INFO L226 Difference]: Without dead ends: 254 [2019-10-02 11:18:14,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-02 11:18:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-10-02 11:18:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-02 11:18:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-10-02 11:18:14,680 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2019-10-02 11:18:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:14,681 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-10-02 11:18:14,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-10-02 11:18:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 11:18:14,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:14,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:14,692 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:14,692 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2019-10-02 11:18:14,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:14,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:14,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:14,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:16,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:16,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-02 11:18:16,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-02 11:18:16,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-02 11:18:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 11:18:16,967 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 63 states. [2019-10-02 11:18:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:18,432 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-10-02 11:18:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 11:18:18,432 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-10-02 11:18:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:18,434 INFO L225 Difference]: With dead ends: 255 [2019-10-02 11:18:18,434 INFO L226 Difference]: Without dead ends: 253 [2019-10-02 11:18:18,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 11:18:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-02 11:18:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-10-02 11:18:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-02 11:18:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-10-02 11:18:18,442 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2019-10-02 11:18:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:18,443 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-10-02 11:18:18,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-02 11:18:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-10-02 11:18:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 11:18:18,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:18,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:18,447 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2019-10-02 11:18:18,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:18,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:18,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:18,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:19,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:19,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:19,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:19,760 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 5 states. [2019-10-02 11:18:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:20,252 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-10-02 11:18:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:20,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-10-02 11:18:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:20,254 INFO L225 Difference]: With dead ends: 254 [2019-10-02 11:18:20,254 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:18:20,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 176 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:18:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:18:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:18:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:18:20,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2019-10-02 11:18:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:20,257 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:18:20,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:18:20,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:18:20,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:18:20,412 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:20,413 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:20,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:20,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:20,413 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:18:20,413 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:20,413 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:20,413 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2019-10-02 11:18:20,413 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 3003) no Hoare annotation was computed. [2019-10-02 11:18:20,413 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2019-10-02 11:18:20,414 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2019-10-02 11:18:20,415 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2019-10-02 11:18:20,416 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2019-10-02 11:18:20,417 INFO L443 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L439 ceAbstractionStarter]: At program point L2620(lines 20 2997) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-02 11:18:20,418 INFO L443 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2019-10-02 11:18:20,419 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2019-10-02 11:18:20,420 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2019-10-02 11:18:20,421 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2019-10-02 11:18:20,422 INFO L443 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L439 ceAbstractionStarter]: At program point L2629(lines 59 2996) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 0 main_~main__t~0)) [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2019-10-02 11:18:20,423 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2019-10-02 11:18:20,424 INFO L443 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2019-10-02 11:18:20,425 INFO L443 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2019-10-02 11:18:20,426 INFO L439 ceAbstractionStarter]: At program point L2635(lines 2586 2642) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 59 main_~main__t~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0))) [2019-10-02 11:18:20,426 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2019-10-02 11:18:20,426 INFO L443 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2019-10-02 11:18:20,426 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2019-10-02 11:18:20,426 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2019-10-02 11:18:20,426 INFO L443 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2019-10-02 11:18:20,426 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2019-10-02 11:18:20,427 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2019-10-02 11:18:20,428 INFO L443 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2019-10-02 11:18:20,429 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2019-10-02 11:18:20,430 INFO L443 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2019-10-02 11:18:20,431 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 3003) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2019-10-02 11:18:20,432 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2019-10-02 11:18:20,433 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2019-10-02 11:18:20,434 INFO L443 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L439 ceAbstractionStarter]: At program point L275(lines 127 277) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~3 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 1 main_~main__t~0)) [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2019-10-02 11:18:20,435 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2019-10-02 11:18:20,436 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2019-10-02 11:18:20,437 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2019-10-02 11:18:20,438 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2019-10-02 11:18:20,439 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2019-10-02 11:18:20,440 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2019-10-02 11:18:20,440 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2019-10-02 11:18:20,440 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2019-10-02 11:18:20,441 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2019-10-02 11:18:20,442 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2019-10-02 11:18:20,443 INFO L439 ceAbstractionStarter]: At program point L221(lines 87 279) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~3 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 1 main_~main__t~0)) [2019-10-02 11:18:20,443 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-02 11:18:20,443 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2019-10-02 11:18:20,443 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2019-10-02 11:18:20,443 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2019-10-02 11:18:20,443 INFO L443 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2019-10-02 11:18:20,443 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2019-10-02 11:18:20,444 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L446 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2019-10-02 11:18:20,445 INFO L443 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 3003) the Hoare annotation is: true [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2019-10-02 11:18:20,446 INFO L443 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2019-10-02 11:18:20,447 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-10-02 11:18:20,448 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 11:18:20,449 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-10-02 11:18:20,449 INFO L443 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-10-02 11:18:20,449 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2019-10-02 11:18:20,449 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2019-10-02 11:18:20,449 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2019-10-02 11:18:20,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:18:20 BoogieIcfgContainer [2019-10-02 11:18:20,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:18:20,473 INFO L168 Benchmark]: Toolchain (without parser) took 18663.22 ms. Allocated memory was 132.6 MB in the beginning and 480.8 MB in the end (delta: 348.1 MB). Free memory was 87.1 MB in the beginning and 228.5 MB in the end (delta: -141.4 MB). Peak memory consumption was 206.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:20,474 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-02 11:18:20,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1042.66 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 86.7 MB in the beginning and 155.1 MB in the end (delta: -68.3 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:20,476 INFO L168 Benchmark]: Boogie Preprocessor took 127.81 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 149.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:20,477 INFO L168 Benchmark]: RCFGBuilder took 1754.48 ms. Allocated memory was 200.8 MB in the beginning and 224.4 MB in the end (delta: 23.6 MB). Free memory was 149.6 MB in the beginning and 97.5 MB in the end (delta: 52.1 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:20,478 INFO L168 Benchmark]: TraceAbstraction took 15733.61 ms. Allocated memory was 224.4 MB in the beginning and 480.8 MB in the end (delta: 256.4 MB). Free memory was 97.5 MB in the beginning and 228.5 MB in the end (delta: -131.0 MB). Peak memory consumption was 125.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:20,482 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.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1042.66 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 86.7 MB in the beginning and 155.1 MB in the end (delta: -68.3 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.81 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 149.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1754.48 ms. Allocated memory was 200.8 MB in the beginning and 224.4 MB in the end (delta: 23.6 MB). Free memory was 149.6 MB in the beginning and 97.5 MB in the end (delta: 52.1 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15733.61 ms. Allocated memory was 224.4 MB in the beginning and 480.8 MB in the end (delta: 256.4 MB). Free memory was 97.5 MB in the beginning and 228.5 MB in the end (delta: -131.0 MB). Peak memory consumption was 125.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2611]: 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: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: 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: 42]: 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: 71]: 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: 180]: 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: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: 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: 59]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 0 <= main__t - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(main__t == main__tagbuf_len)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 59 <= main__t) && !(main__t == main__tagbuf_len) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 309 locations, 16 error locations. SAFE Result, 15.6s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2623 SDtfs, 11666 SDslu, 2920 SDs, 0 SdLazy, 8447 SolverSat, 3227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 40 SyntacticMatches, 181 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 68 HoareAnnotationTreeSize, 10 FomulaSimplifications, 4502 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 117 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 589544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...