java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:28,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:28,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:28,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:28,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:28,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:28,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:28,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:28,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:28,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:28,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:28,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:28,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:28,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:28,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:28,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:28,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:28,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:28,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:28,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:28,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:28,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:28,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:28,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:28,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:28,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:28,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:28,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:28,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:28,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:28,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:28,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:28,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:28,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:28,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:28,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:28,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:28,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:28,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:28,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:28,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:28,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:49:28,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:28,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:28,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:28,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:28,256 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:28,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:28,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:28,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:28,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:28,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:28,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:28,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:28,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:28,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:28,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:28,258 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:28,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:28,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:28,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:28,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:28,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:28,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:28,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:28,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:28,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:28,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:28,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:28,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:28,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:28,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:28,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:28,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:28,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:28,309 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:28,310 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-09-03 19:49:28,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387db2b9c/6952d693173641c9893cd1486a20952b/FLAGea13264c5 [2019-09-03 19:49:28,892 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:28,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-09-03 19:49:28,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387db2b9c/6952d693173641c9893cd1486a20952b/FLAGea13264c5 [2019-09-03 19:49:29,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387db2b9c/6952d693173641c9893cd1486a20952b [2019-09-03 19:49:29,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:29,203 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:29,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:29,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:29,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:29,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:29" (1/1) ... [2019-09-03 19:49:29,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f18e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:29, skipping insertion in model container [2019-09-03 19:49:29,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:29" (1/1) ... [2019-09-03 19:49:29,219 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:29,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:29,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:29,877 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:30,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:30,210 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:30,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30 WrapperNode [2019-09-03 19:49:30,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:30,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:30,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:30,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:30,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:30,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:30,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:30,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:30,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:30,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:30,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:30,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:31,864 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:31,865 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:49:31,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:31 BoogieIcfgContainer [2019-09-03 19:49:31,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:31,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:31,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:31,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:31,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:29" (1/3) ... [2019-09-03 19:49:31,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c12f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:31, skipping insertion in model container [2019-09-03 19:49:31,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30" (2/3) ... [2019-09-03 19:49:31,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c12f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:31, skipping insertion in model container [2019-09-03 19:49:31,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:31" (3/3) ... [2019-09-03 19:49:31,878 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-09-03 19:49:31,888 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:31,895 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 19:49:31,910 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 19:49:31,942 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:31,943 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:31,943 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:31,943 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:31,943 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:31,943 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:31,943 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:31,944 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:31,944 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-09-03 19:49:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:49:31,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:31,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:31,977 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2019-09-03 19:49:31,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:31,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:32,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:32,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:32,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:32,181 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2019-09-03 19:49:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:32,999 INFO L93 Difference]: Finished difference Result 319 states and 579 transitions. [2019-09-03 19:49:32,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:33,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-03 19:49:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:33,016 INFO L225 Difference]: With dead ends: 319 [2019-09-03 19:49:33,016 INFO L226 Difference]: Without dead ends: 302 [2019-09-03 19:49:33,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-03 19:49:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-09-03 19:49:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-03 19:49:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2019-09-03 19:49:33,091 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2019-09-03 19:49:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:33,092 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2019-09-03 19:49:33,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2019-09-03 19:49:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:33,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:33,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:33,094 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2019-09-03 19:49:33,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:33,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:33,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:33,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:33,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:33,158 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 4 states. [2019-09-03 19:49:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:33,547 INFO L93 Difference]: Finished difference Result 309 states and 432 transitions. [2019-09-03 19:49:33,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:33,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:33,551 INFO L225 Difference]: With dead ends: 309 [2019-09-03 19:49:33,551 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 19:49:33,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 19:49:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-09-03 19:49:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 19:49:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-09-03 19:49:33,609 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-09-03 19:49:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:33,611 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-09-03 19:49:33,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-09-03 19:49:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:33,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:33,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:33,613 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2019-09-03 19:49:33,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:33,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:33,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:33,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:33,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:33,677 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-09-03 19:49:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:34,128 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2019-09-03 19:49:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:34,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:34,131 INFO L225 Difference]: With dead ends: 297 [2019-09-03 19:49:34,131 INFO L226 Difference]: Without dead ends: 295 [2019-09-03 19:49:34,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-03 19:49:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-09-03 19:49:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 19:49:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-09-03 19:49:34,144 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2019-09-03 19:49:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:34,145 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-09-03 19:49:34,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-09-03 19:49:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:49:34,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:34,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:34,146 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2019-09-03 19:49:34,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:34,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:34,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:34,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:34,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:34,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:34,185 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-09-03 19:49:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:34,500 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2019-09-03 19:49:34,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:34,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-03 19:49:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:34,502 INFO L225 Difference]: With dead ends: 300 [2019-09-03 19:49:34,502 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 19:49:34,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 19:49:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-03 19:49:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 19:49:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-09-03 19:49:34,513 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2019-09-03 19:49:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:34,513 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-09-03 19:49:34,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-09-03 19:49:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:34,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:34,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:34,515 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2019-09-03 19:49:34,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:34,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:34,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:34,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:34,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:34,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:34,594 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 5 states. [2019-09-03 19:49:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:35,156 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2019-09-03 19:49:35,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:35,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:49:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:35,158 INFO L225 Difference]: With dead ends: 298 [2019-09-03 19:49:35,159 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 19:49:35,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 19:49:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 19:49:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 19:49:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-09-03 19:49:35,170 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2019-09-03 19:49:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:35,170 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-09-03 19:49:35,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-09-03 19:49:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:35,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,173 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2019-09-03 19:49:35,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:35,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:35,204 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-09-03 19:49:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:35,520 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-09-03 19:49:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:35,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 19:49:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:35,523 INFO L225 Difference]: With dead ends: 296 [2019-09-03 19:49:35,523 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 19:49:35,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 19:49:35,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-09-03 19:49:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-03 19:49:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-09-03 19:49:35,532 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2019-09-03 19:49:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:35,532 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-09-03 19:49:35,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-09-03 19:49:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:35,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,534 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,534 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2019-09-03 19:49:35,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:35,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:35,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:35,610 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 5 states. [2019-09-03 19:49:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,156 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2019-09-03 19:49:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:36,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,163 INFO L225 Difference]: With dead ends: 292 [2019-09-03 19:49:36,164 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 19:49:36,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 19:49:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-09-03 19:49:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 19:49:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-09-03 19:49:36,172 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2019-09-03 19:49:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,173 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-09-03 19:49:36,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-09-03 19:49:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:36,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,175 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2019-09-03 19:49:36,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:36,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:36,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:36,212 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-09-03 19:49:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,692 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2019-09-03 19:49:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:36,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,695 INFO L225 Difference]: With dead ends: 307 [2019-09-03 19:49:36,696 INFO L226 Difference]: Without dead ends: 305 [2019-09-03 19:49:36,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-03 19:49:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2019-09-03 19:49:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-03 19:49:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2019-09-03 19:49:36,704 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2019-09-03 19:49:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,705 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2019-09-03 19:49:36,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2019-09-03 19:49:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:36,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,706 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2019-09-03 19:49:36,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:36,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:36,748 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 5 states. [2019-09-03 19:49:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,244 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2019-09-03 19:49:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:37,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,247 INFO L225 Difference]: With dead ends: 288 [2019-09-03 19:49:37,247 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 19:49:37,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 19:49:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-09-03 19:49:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-03 19:49:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-09-03 19:49:37,256 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2019-09-03 19:49:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,256 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-09-03 19:49:37,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-09-03 19:49:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:37,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,258 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2019-09-03 19:49:37,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:37,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,288 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 5 states. [2019-09-03 19:49:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,830 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2019-09-03 19:49:37,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:37,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,833 INFO L225 Difference]: With dead ends: 306 [2019-09-03 19:49:37,833 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 19:49:37,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 19:49:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2019-09-03 19:49:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 19:49:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-09-03 19:49:37,841 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2019-09-03 19:49:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,842 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-09-03 19:49:37,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-09-03 19:49:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:37,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,843 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2019-09-03 19:49:37,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,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-09-03 19:49:37,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,892 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 5 states. [2019-09-03 19:49:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:38,421 INFO L93 Difference]: Finished difference Result 295 states and 360 transitions. [2019-09-03 19:49:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:38,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:38,424 INFO L225 Difference]: With dead ends: 295 [2019-09-03 19:49:38,424 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 19:49:38,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 19:49:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2019-09-03 19:49:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 19:49:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-09-03 19:49:38,432 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2019-09-03 19:49:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:38,433 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-09-03 19:49:38,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-09-03 19:49:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:38,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:38,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:38,434 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2019-09-03 19:49:38,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:38,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:38,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:38,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:38,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:38,498 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 5 states. [2019-09-03 19:49:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:39,064 INFO L93 Difference]: Finished difference Result 279 states and 342 transitions. [2019-09-03 19:49:39,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:39,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:39,067 INFO L225 Difference]: With dead ends: 279 [2019-09-03 19:49:39,068 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 19:49:39,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 19:49:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-09-03 19:49:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-03 19:49:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-09-03 19:49:39,080 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2019-09-03 19:49:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:39,083 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-09-03 19:49:39,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-09-03 19:49:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:49:39,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:39,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:39,087 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2019-09-03 19:49:39,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:39,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:39,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:39,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:39,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:39,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:39,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:39,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:39,196 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 5 states. [2019-09-03 19:49:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:39,765 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2019-09-03 19:49:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:39,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 19:49:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:39,768 INFO L225 Difference]: With dead ends: 290 [2019-09-03 19:49:39,768 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 19:49:39,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 19:49:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2019-09-03 19:49:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 19:49:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2019-09-03 19:49:39,777 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2019-09-03 19:49:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:39,777 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2019-09-03 19:49:39,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2019-09-03 19:49:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:49:39,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:39,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:39,778 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2019-09-03 19:49:39,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:39,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:39,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:39,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:39,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:39,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:39,816 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 4 states. [2019-09-03 19:49:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:40,011 INFO L93 Difference]: Finished difference Result 273 states and 336 transitions. [2019-09-03 19:49:40,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:40,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 19:49:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:40,015 INFO L225 Difference]: With dead ends: 273 [2019-09-03 19:49:40,015 INFO L226 Difference]: Without dead ends: 271 [2019-09-03 19:49:40,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-03 19:49:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-09-03 19:49:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 19:49:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-09-03 19:49:40,022 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2019-09-03 19:49:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:40,023 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-09-03 19:49:40,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-09-03 19:49:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:49:40,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:40,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:40,024 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2019-09-03 19:49:40,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:40,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:40,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:40,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:40,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:40,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:40,057 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 4 states. [2019-09-03 19:49:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:40,344 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2019-09-03 19:49:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:40,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 19:49:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:40,346 INFO L225 Difference]: With dead ends: 274 [2019-09-03 19:49:40,346 INFO L226 Difference]: Without dead ends: 254 [2019-09-03 19:49:40,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-03 19:49:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-09-03 19:49:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-03 19:49:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-09-03 19:49:40,352 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2019-09-03 19:49:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:40,352 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-09-03 19:49:40,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-09-03 19:49:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 19:49:40,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:40,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:40,358 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2019-09-03 19:49:40,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:40,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:40,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:40,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:40,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-03 19:49:42,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:49:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:49:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:49:42,698 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 63 states. [2019-09-03 19:49:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,070 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-09-03 19:49:44,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:49:44,071 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-03 19:49:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,073 INFO L225 Difference]: With dead ends: 255 [2019-09-03 19:49:44,073 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 19:49:44,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:49:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 19:49:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-09-03 19:49:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-03 19:49:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-09-03 19:49:44,080 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2019-09-03 19:49:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,081 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-09-03 19:49:44,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:49:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-09-03 19:49:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-03 19:49:44,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,085 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2019-09-03 19:49:44,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,224 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 5 states. [2019-09-03 19:49:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,769 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-09-03 19:49:45,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:45,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-03 19:49:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,770 INFO L225 Difference]: With dead ends: 254 [2019-09-03 19:49:45,770 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:49:45,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 5 SyntacticMatches, 174 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:49:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:49:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:49:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:49:45,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2019-09-03 19:49:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,773 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:49:45,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:49:45,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:49:45,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:49:45,890 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:45,890 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:45,891 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:45,891 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:45,891 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:49:45,891 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:45,891 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:45,891 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2019-09-03 19:49:45,891 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 3003) no Hoare annotation was computed. [2019-09-03 19:49:45,891 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2019-09-03 19:49:45,892 INFO L443 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2019-09-03 19:49:45,893 INFO L443 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2019-09-03 19:49:45,894 INFO L443 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2019-09-03 19:49:45,895 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2019-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2019-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2019-09-03 19:49:45,896 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-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2019-09-03 19:49:45,896 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2019-09-03 19:49:45,897 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2019-09-03 19:49:45,898 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2019-09-03 19:49:45,899 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2019-09-03 19:49:45,900 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2019-09-03 19:49:45,901 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-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2019-09-03 19:49:45,901 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2019-09-03 19:49:45,902 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2019-09-03 19:49:45,903 INFO L443 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2019-09-03 19:49:45,904 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-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2019-09-03 19:49:45,904 INFO L443 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2019-09-03 19:49:45,905 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2019-09-03 19:49:45,906 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2019-09-03 19:49:45,907 INFO L443 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2019-09-03 19:49:45,908 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 3003) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2019-09-03 19:49:45,909 INFO L443 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2019-09-03 19:49:45,910 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2019-09-03 19:49:45,911 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2019-09-03 19:49:45,912 INFO L443 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2019-09-03 19:49:45,913 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-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2019-09-03 19:49:45,913 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2019-09-03 19:49:45,914 INFO L443 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2019-09-03 19:49:45,915 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2019-09-03 19:49:45,916 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2019-09-03 19:49:45,917 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2019-09-03 19:49:45,918 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2019-09-03 19:49:45,918 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2019-09-03 19:49:45,919 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2019-09-03 19:49:45,919 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-09-03 19:49:45,921 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2019-09-03 19:49:45,922 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2019-09-03 19:49:45,923 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L446 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2019-09-03 19:49:45,924 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 3003) the Hoare annotation is: true [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2019-09-03 19:49:45,925 INFO L443 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2019-09-03 19:49:45,926 INFO L443 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2019-09-03 19:49:45,927 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2019-09-03 19:49:45,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:49:45 BoogieIcfgContainer [2019-09-03 19:49:45,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:49:45,964 INFO L168 Benchmark]: Toolchain (without parser) took 16759.04 ms. Allocated memory was 133.7 MB in the beginning and 476.6 MB in the end (delta: 342.9 MB). Free memory was 86.7 MB in the beginning and 272.2 MB in the end (delta: -185.5 MB). Peak memory consumption was 157.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:45,965 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-03 19:49:45,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1006.94 ms. Allocated memory was 133.7 MB in the beginning and 202.4 MB in the end (delta: 68.7 MB). Free memory was 86.5 MB in the beginning and 157.8 MB in the end (delta: -71.3 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:45,970 INFO L168 Benchmark]: Boogie Preprocessor took 148.42 ms. Allocated memory is still 202.4 MB. Free memory was 157.8 MB in the beginning and 152.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:45,971 INFO L168 Benchmark]: RCFGBuilder took 1505.65 ms. Allocated memory was 202.4 MB in the beginning and 228.1 MB in the end (delta: 25.7 MB). Free memory was 152.5 MB in the beginning and 104.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:45,976 INFO L168 Benchmark]: TraceAbstraction took 14092.86 ms. Allocated memory was 228.1 MB in the beginning and 476.6 MB in the end (delta: 248.5 MB). Free memory was 104.8 MB in the beginning and 272.2 MB in the end (delta: -167.4 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:45,982 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.21 ms. Allocated memory is still 133.7 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1006.94 ms. Allocated memory was 133.7 MB in the beginning and 202.4 MB in the end (delta: 68.7 MB). Free memory was 86.5 MB in the beginning and 157.8 MB in the end (delta: -71.3 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.42 ms. Allocated memory is still 202.4 MB. Free memory was 157.8 MB in the beginning and 152.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1505.65 ms. Allocated memory was 202.4 MB in the beginning and 228.1 MB in the end (delta: 25.7 MB). Free memory was 152.5 MB in the beginning and 104.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14092.86 ms. Allocated memory was 228.1 MB in the beginning and 476.6 MB in the end (delta: 248.5 MB). Free memory was 104.8 MB in the beginning and 272.2 MB in the end (delta: -167.4 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: 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: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: 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: 140]: 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: 2599]: 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: 71]: 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: 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: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 0 <= main__t - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(main__t == main__tagbuf_len)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 59 <= main__t) && !(main__t == main__tagbuf_len) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 309 locations, 16 error locations. SAFE Result, 13.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2745 SDtfs, 11211 SDslu, 3036 SDs, 0 SdLazy, 8151 SolverSat, 3041 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 42 SyntacticMatches, 179 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 86 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 68 HoareAnnotationTreeSize, 10 FomulaSimplifications, 1366 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 589126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...