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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:40:15,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:40:15,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:40:15,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:40:15,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:40:15,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:40:15,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:40:15,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:40:15,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:40:15,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:40:15,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:40:15,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:40:15,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:40:15,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:40:15,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:40:15,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:40:15,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:40:15,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:40:15,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:40:15,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:40:15,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:40:15,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:40:15,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:40:15,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:40:15,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:40:15,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:40:15,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:40:15,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:40:15,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:40:15,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:40:15,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:40:15,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:40:15,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:40:15,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:40:15,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:40:15,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:40:15,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:40:15,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:40:15,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:40:15,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:40:15,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:40:15,912 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-07 13:40:15,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:40:15,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:40:15,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:40:15,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:40:15,929 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:40:15,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:40:15,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:40:15,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:40:15,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:40:15,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:40:15,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:40:15,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:40:15,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:40:15,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:40:15,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:40:15,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:40:15,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:40:15,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:40:15,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:40:15,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:40:15,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:40:15,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:40:15,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:40:15,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:40:15,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:40:15,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:40:15,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:40:15,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:40:15,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:40:16,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:40:16,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:40:16,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:40:16,229 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:40:16,229 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:40:16,230 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-07 13:40:16,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb71e7bb6/cdffa9a9d2ca4ee8b495aa356846f379/FLAG9dbc1e087 [2019-10-07 13:40:16,830 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:40:16,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-10-07 13:40:16,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb71e7bb6/cdffa9a9d2ca4ee8b495aa356846f379/FLAG9dbc1e087 [2019-10-07 13:40:17,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb71e7bb6/cdffa9a9d2ca4ee8b495aa356846f379 [2019-10-07 13:40:17,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:40:17,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:40:17,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:17,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:40:17,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:40:17,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:17" (1/1) ... [2019-10-07 13:40:17,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6e6c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:17, skipping insertion in model container [2019-10-07 13:40:17,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:17" (1/1) ... [2019-10-07 13:40:17,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:40:17,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:40:17,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:17,815 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:40:18,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:18,054 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:40:18,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18 WrapperNode [2019-10-07 13:40:18,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:18,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:40:18,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:40:18,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:40:18,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (1/1) ... [2019-10-07 13:40:18,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:40:18,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:40:18,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:40:18,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:40:18,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (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-07 13:40:18,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:40:18,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:40:18,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:40:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:40:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:40:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:40:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:40:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:40:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:40:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:40:19,872 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:40:19,873 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 13:40:19,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:19 BoogieIcfgContainer [2019-10-07 13:40:19,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:40:19,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:40:19,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:40:19,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:40:19,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:40:17" (1/3) ... [2019-10-07 13:40:19,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c32518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:19, skipping insertion in model container [2019-10-07 13:40:19,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:18" (2/3) ... [2019-10-07 13:40:19,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c32518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:19, skipping insertion in model container [2019-10-07 13:40:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:19" (3/3) ... [2019-10-07 13:40:19,891 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-10-07 13:40:19,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:40:19,921 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-07 13:40:19,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-07 13:40:19,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:40:19,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:40:19,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:40:19,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:40:19,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:40:19,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:40:19,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:40:19,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:40:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states. [2019-10-07 13:40:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:40:20,044 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:20,045 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:20,048 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1962000724, now seen corresponding path program 1 times [2019-10-07 13:40:20,065 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:20,065 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:20,066 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:20,066 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:20,247 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-07 13:40:20,248 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:20,249 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:20,249 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:20,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:20,271 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 4 states. [2019-10-07 13:40:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:21,217 INFO L93 Difference]: Finished difference Result 318 states and 578 transitions. [2019-10-07 13:40:21,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:21,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:40:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:21,233 INFO L225 Difference]: With dead ends: 318 [2019-10-07 13:40:21,233 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 13:40:21,236 INFO L606 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-07 13:40:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 13:40:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 13:40:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 13:40:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2019-10-07 13:40:21,300 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 10 [2019-10-07 13:40:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:21,300 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2019-10-07 13:40:21,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2019-10-07 13:40:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:40:21,301 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:21,302 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:21,302 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:21,303 INFO L82 PathProgramCache]: Analyzing trace with hash -692477239, now seen corresponding path program 1 times [2019-10-07 13:40:21,303 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:21,303 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:21,303 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:21,303 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:21,343 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-07 13:40:21,344 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:21,344 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:21,344 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:21,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:21,347 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand 4 states. [2019-10-07 13:40:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:21,808 INFO L93 Difference]: Finished difference Result 308 states and 431 transitions. [2019-10-07 13:40:21,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:21,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:40:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:21,812 INFO L225 Difference]: With dead ends: 308 [2019-10-07 13:40:21,812 INFO L226 Difference]: Without dead ends: 303 [2019-10-07 13:40:21,813 INFO L606 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-07 13:40:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-07 13:40:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2019-10-07 13:40:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-07 13:40:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-10-07 13:40:21,832 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 11 [2019-10-07 13:40:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:21,833 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-10-07 13:40:21,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-10-07 13:40:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:40:21,833 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:21,834 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:21,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash -676227242, now seen corresponding path program 1 times [2019-10-07 13:40:21,835 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:21,835 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:21,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:21,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:21,892 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-07 13:40:21,893 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:21,893 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:21,893 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:21,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:21,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:21,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:21,899 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-10-07 13:40:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:22,426 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-10-07 13:40:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:22,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:40:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:22,430 INFO L225 Difference]: With dead ends: 296 [2019-10-07 13:40:22,430 INFO L226 Difference]: Without dead ends: 294 [2019-10-07 13:40:22,431 INFO L606 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-07 13:40:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-07 13:40:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-07 13:40:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-07 13:40:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2019-10-07 13:40:22,445 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 11 [2019-10-07 13:40:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:22,445 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2019-10-07 13:40:22,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2019-10-07 13:40:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:40:22,446 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:22,446 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:22,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash 511795059, now seen corresponding path program 1 times [2019-10-07 13:40:22,447 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:22,448 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:22,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:22,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:22,491 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-07 13:40:22,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:22,492 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:22,492 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:22,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:22,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:22,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:22,493 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand 4 states. [2019-10-07 13:40:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:22,870 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-10-07 13:40:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:22,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:40:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:22,873 INFO L225 Difference]: With dead ends: 299 [2019-10-07 13:40:22,874 INFO L226 Difference]: Without dead ends: 297 [2019-10-07 13:40:22,874 INFO L606 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-07 13:40:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-07 13:40:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-10-07 13:40:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-07 13:40:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-10-07 13:40:22,886 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-10-07 13:40:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:22,886 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-10-07 13:40:22,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-10-07 13:40:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:40:22,887 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:22,887 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:22,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2086090537, now seen corresponding path program 1 times [2019-10-07 13:40:22,888 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:22,889 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:22,889 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:22,889 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:22,935 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-07 13:40:22,935 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:22,936 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:22,936 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:22,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:22,937 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 5 states. [2019-10-07 13:40:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:23,490 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2019-10-07 13:40:23,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:23,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-07 13:40:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:23,493 INFO L225 Difference]: With dead ends: 297 [2019-10-07 13:40:23,493 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 13:40:23,494 INFO L606 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-07 13:40:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 13:40:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-07 13:40:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-07 13:40:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-10-07 13:40:23,503 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 14 [2019-10-07 13:40:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:23,503 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-10-07 13:40:23,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-10-07 13:40:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:40:23,504 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:23,504 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:23,505 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash -244294110, now seen corresponding path program 1 times [2019-10-07 13:40:23,505 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:23,506 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:23,506 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:23,506 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:23,543 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-07 13:40:23,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:23,543 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:23,544 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:23,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:23,545 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-10-07 13:40:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:23,937 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-10-07 13:40:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:23,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:40:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:23,940 INFO L225 Difference]: With dead ends: 295 [2019-10-07 13:40:23,940 INFO L226 Difference]: Without dead ends: 291 [2019-10-07 13:40:23,941 INFO L606 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-07 13:40:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-10-07 13:40:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-10-07 13:40:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-07 13:40:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2019-10-07 13:40:23,949 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 15 [2019-10-07 13:40:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:23,950 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2019-10-07 13:40:23,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2019-10-07 13:40:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:23,951 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:23,951 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:23,951 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1367121598, now seen corresponding path program 1 times [2019-10-07 13:40:23,952 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:23,952 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:23,952 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:23,953 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:24,025 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-07 13:40:24,026 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:24,026 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:24,026 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:24,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:24,028 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand 5 states. [2019-10-07 13:40:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:24,619 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2019-10-07 13:40:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:24,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:24,622 INFO L225 Difference]: With dead ends: 291 [2019-10-07 13:40:24,622 INFO L226 Difference]: Without dead ends: 289 [2019-10-07 13:40:24,623 INFO L606 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-07 13:40:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-07 13:40:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-10-07 13:40:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-07 13:40:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2019-10-07 13:40:24,639 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 16 [2019-10-07 13:40:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:24,640 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2019-10-07 13:40:24,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2019-10-07 13:40:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:24,641 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:24,641 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:24,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1030085224, now seen corresponding path program 1 times [2019-10-07 13:40:24,642 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:24,643 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:24,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:24,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:24,744 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-07 13:40:24,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:24,744 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:24,745 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:24,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:24,746 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand 5 states. [2019-10-07 13:40:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:25,431 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2019-10-07 13:40:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:25,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:25,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:25,434 INFO L225 Difference]: With dead ends: 306 [2019-10-07 13:40:25,434 INFO L226 Difference]: Without dead ends: 304 [2019-10-07 13:40:25,435 INFO L606 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-07 13:40:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-07 13:40:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 284. [2019-10-07 13:40:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-07 13:40:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 347 transitions. [2019-10-07 13:40:25,444 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 347 transitions. Word has length 16 [2019-10-07 13:40:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:25,444 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 347 transitions. [2019-10-07 13:40:25,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 347 transitions. [2019-10-07 13:40:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:25,448 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:25,448 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:25,449 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1031624424, now seen corresponding path program 1 times [2019-10-07 13:40:25,449 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:25,449 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:25,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:25,450 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:25,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:25,534 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-07 13:40:25,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:25,535 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:25,535 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:25,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:25,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:25,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:25,536 INFO L87 Difference]: Start difference. First operand 284 states and 347 transitions. Second operand 5 states. [2019-10-07 13:40:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:26,046 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2019-10-07 13:40:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:26,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:26,049 INFO L225 Difference]: With dead ends: 287 [2019-10-07 13:40:26,050 INFO L226 Difference]: Without dead ends: 285 [2019-10-07 13:40:26,050 INFO L606 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-07 13:40:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-07 13:40:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-10-07 13:40:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-07 13:40:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2019-10-07 13:40:26,059 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 16 [2019-10-07 13:40:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:26,059 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2019-10-07 13:40:26,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2019-10-07 13:40:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:26,060 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:26,060 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:26,061 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1869239409, now seen corresponding path program 1 times [2019-10-07 13:40:26,062 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:26,062 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:26,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:26,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:26,118 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-07 13:40:26,119 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:26,119 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:26,119 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:26,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:26,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:26,120 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 5 states. [2019-10-07 13:40:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:26,674 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2019-10-07 13:40:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:26,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:26,680 INFO L225 Difference]: With dead ends: 305 [2019-10-07 13:40:26,680 INFO L226 Difference]: Without dead ends: 303 [2019-10-07 13:40:26,681 INFO L606 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-07 13:40:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-07 13:40:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2019-10-07 13:40:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-07 13:40:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2019-10-07 13:40:26,689 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 17 [2019-10-07 13:40:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:26,689 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2019-10-07 13:40:26,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2019-10-07 13:40:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:26,690 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:26,690 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:26,691 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1867873989, now seen corresponding path program 1 times [2019-10-07 13:40:26,691 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:26,692 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:26,692 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:26,692 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:26,751 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-07 13:40:26,751 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:26,752 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:26,752 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:26,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:26,753 INFO L87 Difference]: Start difference. First operand 280 states and 343 transitions. Second operand 5 states. [2019-10-07 13:40:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:27,391 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2019-10-07 13:40:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:27,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:27,394 INFO L225 Difference]: With dead ends: 294 [2019-10-07 13:40:27,395 INFO L226 Difference]: Without dead ends: 292 [2019-10-07 13:40:27,395 INFO L606 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-07 13:40:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-07 13:40:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 278. [2019-10-07 13:40:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-07 13:40:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 341 transitions. [2019-10-07 13:40:27,403 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 341 transitions. Word has length 17 [2019-10-07 13:40:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:27,404 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 341 transitions. [2019-10-07 13:40:27,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 341 transitions. [2019-10-07 13:40:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:27,405 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:27,405 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:27,405 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1915589239, now seen corresponding path program 1 times [2019-10-07 13:40:27,406 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:27,406 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:27,406 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:27,406 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:27,463 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-07 13:40:27,463 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:27,464 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:27,464 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:27,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:27,465 INFO L87 Difference]: Start difference. First operand 278 states and 341 transitions. Second operand 5 states. [2019-10-07 13:40:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:28,027 INFO L93 Difference]: Finished difference Result 278 states and 341 transitions. [2019-10-07 13:40:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:28,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:28,029 INFO L225 Difference]: With dead ends: 278 [2019-10-07 13:40:28,029 INFO L226 Difference]: Without dead ends: 274 [2019-10-07 13:40:28,029 INFO L606 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-07 13:40:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-07 13:40:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-10-07 13:40:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-10-07 13:40:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 337 transitions. [2019-10-07 13:40:28,037 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 337 transitions. Word has length 17 [2019-10-07 13:40:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:28,037 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 337 transitions. [2019-10-07 13:40:28,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 337 transitions. [2019-10-07 13:40:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:28,038 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:28,038 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:28,038 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:28,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2111849979, now seen corresponding path program 1 times [2019-10-07 13:40:28,039 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:28,039 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:28,040 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:28,040 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:28,129 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:28,130 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:28,130 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:28,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:28,131 INFO L87 Difference]: Start difference. First operand 274 states and 337 transitions. Second operand 5 states. [2019-10-07 13:40:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:28,809 INFO L93 Difference]: Finished difference Result 289 states and 354 transitions. [2019-10-07 13:40:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:28,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-07 13:40:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:28,812 INFO L225 Difference]: With dead ends: 289 [2019-10-07 13:40:28,812 INFO L226 Difference]: Without dead ends: 287 [2019-10-07 13:40:28,813 INFO L606 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-07 13:40:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-07 13:40:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 272. [2019-10-07 13:40:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-07 13:40:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 335 transitions. [2019-10-07 13:40:28,821 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 335 transitions. Word has length 18 [2019-10-07 13:40:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:28,823 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 335 transitions. [2019-10-07 13:40:28,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 335 transitions. [2019-10-07 13:40:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:40:28,826 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:28,826 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:28,827 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash -269329336, now seen corresponding path program 1 times [2019-10-07 13:40:28,827 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:28,828 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:28,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:28,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:28,891 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-07 13:40:28,892 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:28,892 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:28,892 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:28,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:28,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:28,893 INFO L87 Difference]: Start difference. First operand 272 states and 335 transitions. Second operand 6 states. [2019-10-07 13:40:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:29,504 INFO L93 Difference]: Finished difference Result 287 states and 352 transitions. [2019-10-07 13:40:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:29,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-07 13:40:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:29,507 INFO L225 Difference]: With dead ends: 287 [2019-10-07 13:40:29,507 INFO L226 Difference]: Without dead ends: 285 [2019-10-07 13:40:29,508 INFO L606 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-07 13:40:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-07 13:40:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 270. [2019-10-07 13:40:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-07 13:40:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 333 transitions. [2019-10-07 13:40:29,516 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 333 transitions. Word has length 19 [2019-10-07 13:40:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:29,517 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 333 transitions. [2019-10-07 13:40:29,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 333 transitions. [2019-10-07 13:40:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:40:29,518 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:29,518 INFO L385 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-07 13:40:29,518 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:29,519 INFO L82 PathProgramCache]: Analyzing trace with hash 240728308, now seen corresponding path program 1 times [2019-10-07 13:40:29,519 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:29,519 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:29,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:29,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:29,552 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-07 13:40:29,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:29,553 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:29,553 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:29,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:29,554 INFO L87 Difference]: Start difference. First operand 270 states and 333 transitions. Second operand 4 states. [2019-10-07 13:40:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:29,915 INFO L93 Difference]: Finished difference Result 273 states and 336 transitions. [2019-10-07 13:40:29,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:29,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 13:40:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:29,916 INFO L225 Difference]: With dead ends: 273 [2019-10-07 13:40:29,917 INFO L226 Difference]: Without dead ends: 253 [2019-10-07 13:40:29,918 INFO L606 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-07 13:40:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-07 13:40:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-10-07 13:40:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-07 13:40:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-10-07 13:40:29,926 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 20 [2019-10-07 13:40:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:29,926 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-10-07 13:40:29,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-10-07 13:40:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-07 13:40:29,933 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:29,934 INFO L385 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] [2019-10-07 13:40:29,938 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 25963049, now seen corresponding path program 1 times [2019-10-07 13:40:29,941 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:29,941 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:29,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:29,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:32,162 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-07 13:40:32,162 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:32,162 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:32,163 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-07 13:40:32,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-07 13:40:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-07 13:40:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:40:32,167 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 63 states. [2019-10-07 13:40:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:33,604 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-10-07 13:40:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-07 13:40:33,605 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-10-07 13:40:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:33,607 INFO L225 Difference]: With dead ends: 254 [2019-10-07 13:40:33,607 INFO L226 Difference]: Without dead ends: 252 [2019-10-07 13:40:33,610 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-10-07 13:40:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-07 13:40:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-10-07 13:40:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-07 13:40:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-10-07 13:40:33,616 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2019-10-07 13:40:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:33,616 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-10-07 13:40:33,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-07 13:40:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-10-07 13:40:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 13:40:33,619 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:33,619 INFO L385 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-07 13:40:33,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:33,621 INFO L82 PathProgramCache]: Analyzing trace with hash 804858766, now seen corresponding path program 1 times [2019-10-07 13:40:33,621 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:33,621 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:33,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:33,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:34,919 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-07 13:40:34,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:34,920 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:34,920 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:34,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:34,921 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 5 states. [2019-10-07 13:40:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:35,447 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-10-07 13:40:35,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:35,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-10-07 13:40:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:35,449 INFO L225 Difference]: With dead ends: 253 [2019-10-07 13:40:35,449 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:40:35,452 INFO L606 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-07 13:40:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:40:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:40:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:40:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:40:35,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2019-10-07 13:40:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:35,454 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:40:35,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:40:35,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:40:35,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:40:35,607 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:35,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:35,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:35,608 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:40:35,608 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:35,608 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:40:35,608 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2019-10-07 13:40:35,608 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 3003) no Hoare annotation was computed. [2019-10-07 13:40:35,608 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2019-10-07 13:40:35,608 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2019-10-07 13:40:35,608 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2019-10-07 13:40:35,609 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2019-10-07 13:40:35,610 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2019-10-07 13:40:35,611 INFO L443 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2019-10-07 13:40:35,612 INFO L443 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2019-10-07 13:40:35,613 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-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-10-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2019-10-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2019-10-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2019-10-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2019-10-07 13:40:35,613 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2019-10-07 13:40:35,614 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2019-10-07 13:40:35,615 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-10-07 13:40:35,616 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2019-10-07 13:40:35,617 INFO L443 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2019-10-07 13:40:35,617 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-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-07 13:40:35,618 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2019-10-07 13:40:35,619 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2019-10-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2019-10-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2019-10-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2019-10-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2019-10-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2019-10-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2019-10-07 13:40:35,620 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-07 13:40:35,620 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2019-10-07 13:40:35,621 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2019-10-07 13:40:35,622 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2019-10-07 13:40:35,623 INFO L443 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2019-10-07 13:40:35,624 INFO L443 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2019-10-07 13:40:35,625 INFO L443 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 3003) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2019-10-07 13:40:35,626 INFO L443 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2019-10-07 13:40:35,627 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2019-10-07 13:40:35,628 INFO L443 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2019-10-07 13:40:35,629 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-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2019-10-07 13:40:35,629 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2019-10-07 13:40:35,630 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2019-10-07 13:40:35,631 INFO L443 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2019-10-07 13:40:35,632 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2019-10-07 13:40:35,633 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2019-10-07 13:40:35,634 INFO L443 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2019-10-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2019-10-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2019-10-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2019-10-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2019-10-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2019-10-07 13:40:35,635 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-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2019-10-07 13:40:35,635 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2019-10-07 13:40:35,636 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2019-10-07 13:40:35,637 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L446 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2019-10-07 13:40:35,638 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 3003) the Hoare annotation is: true [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2019-10-07 13:40:35,639 INFO L443 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2019-10-07 13:40:35,640 INFO L443 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2019-10-07 13:40:35,641 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2019-10-07 13:40:35,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:40:35 BoogieIcfgContainer [2019-10-07 13:40:35,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:40:35,664 INFO L168 Benchmark]: Toolchain (without parser) took 18564.57 ms. Allocated memory was 137.9 MB in the beginning and 455.6 MB in the end (delta: 317.7 MB). Free memory was 101.6 MB in the beginning and 333.1 MB in the end (delta: -231.5 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:35,665 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 13:40:35,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 955.73 ms. Allocated memory was 137.9 MB in the beginning and 206.0 MB in the end (delta: 68.2 MB). Free memory was 101.4 MB in the beginning and 170.5 MB in the end (delta: -69.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:35,667 INFO L168 Benchmark]: Boogie Preprocessor took 118.55 ms. Allocated memory is still 206.0 MB. Free memory was 170.5 MB in the beginning and 165.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:35,668 INFO L168 Benchmark]: RCFGBuilder took 1701.27 ms. Allocated memory was 206.0 MB in the beginning and 238.0 MB in the end (delta: 32.0 MB). Free memory was 165.3 MB in the beginning and 119.4 MB in the end (delta: 45.9 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:35,669 INFO L168 Benchmark]: TraceAbstraction took 15783.63 ms. Allocated memory was 238.0 MB in the beginning and 455.6 MB in the end (delta: 217.6 MB). Free memory was 117.9 MB in the beginning and 333.1 MB in the end (delta: -215.2 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:35,673 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 955.73 ms. Allocated memory was 137.9 MB in the beginning and 206.0 MB in the end (delta: 68.2 MB). Free memory was 101.4 MB in the beginning and 170.5 MB in the end (delta: -69.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.55 ms. Allocated memory is still 206.0 MB. Free memory was 170.5 MB in the beginning and 165.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1701.27 ms. Allocated memory was 206.0 MB in the beginning and 238.0 MB in the end (delta: 32.0 MB). Free memory was 165.3 MB in the beginning and 119.4 MB in the end (delta: 45.9 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15783.63 ms. Allocated memory was 238.0 MB in the beginning and 455.6 MB in the end (delta: 217.6 MB). Free memory was 117.9 MB in the beginning and 333.1 MB in the end (delta: -215.2 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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: 214]: 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: 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 - 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: 30]: 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: 71]: 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: 180]: 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: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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, 308 locations, 16 error locations. Result: SAFE, OverallTime: 15.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 2606 SDtfs, 11666 SDslu, 2886 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.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 585940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...