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+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:29,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:29,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:29,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:29,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:29,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:29,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:29,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:29,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:29,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:29,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:29,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:29,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:29,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:29,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:29,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:29,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:29,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:29,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:29,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:29,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:29,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:29,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:29,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:29,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:29,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:29,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:29,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:29,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:29,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:29,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:29,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:29,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:29,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:29,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:29,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:29,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:29,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:29,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:29,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:29,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:29,851 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:29,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:29,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:29,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:29,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:29,867 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:29,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:29,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:29,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:29,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:29,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:29,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:29,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:29,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:29,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:29,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:29,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:29,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:29,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:29,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:29,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:29,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:29,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:29,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:29,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:29,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:29,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:29,872 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:29,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:29,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:29,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:29,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:29,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:29,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:29,931 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:29,931 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+sep-reducer.c [2019-09-03 19:49:29,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143353aeb/6b87cb2d3bd148c6aa753084216499a4/FLAG059445022 [2019-09-03 19:49:30,603 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:30,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-03 19:49:30,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143353aeb/6b87cb2d3bd148c6aa753084216499a4/FLAG059445022 [2019-09-03 19:49:30,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143353aeb/6b87cb2d3bd148c6aa753084216499a4 [2019-09-03 19:49:30,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:30,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:30,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:30,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:30,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:30,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18030d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:30, skipping insertion in model container [2019-09-03 19:49:30,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:30" (1/1) ... [2019-09-03 19:49:30,805 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:30,946 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:31,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:31,880 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:32,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:32,188 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:32,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:32 WrapperNode [2019-09-03 19:49:32,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:32,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:32,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:32,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:32,212 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:32" (1/1) ... [2019-09-03 19:49:32,213 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:32" (1/1) ... [2019-09-03 19:49:32,273 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:32" (1/1) ... [2019-09-03 19:49:32,274 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:32" (1/1) ... [2019-09-03 19:49:32,323 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:32" (1/1) ... [2019-09-03 19:49:32,358 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:32" (1/1) ... [2019-09-03 19:49:32,376 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:32" (1/1) ... [2019-09-03 19:49:32,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:32,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:32,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:32,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:32,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:32" (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:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:32,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:32,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:34,904 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:34,905 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:49:34,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:34 BoogieIcfgContainer [2019-09-03 19:49:34,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:34,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:34,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:34,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:34,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:30" (1/3) ... [2019-09-03 19:49:34,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e9f238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:34, skipping insertion in model container [2019-09-03 19:49:34,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:32" (2/3) ... [2019-09-03 19:49:34,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e9f238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:34, skipping insertion in model container [2019-09-03 19:49:34,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:34" (3/3) ... [2019-09-03 19:49:34,914 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-09-03 19:49:34,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:34,931 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 19:49:34,947 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 19:49:34,980 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:34,981 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:34,981 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:34,981 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:34,981 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:34,981 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:34,982 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:34,982 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:34,982 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-03 19:49:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:49:35,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,017 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-09-03 19:49:35,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,186 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,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:35,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:35,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:35,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:35,210 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-09-03 19:49:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,563 INFO L93 Difference]: Finished difference Result 490 states and 915 transitions. [2019-09-03 19:49:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:36,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-03 19:49:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,580 INFO L225 Difference]: With dead ends: 490 [2019-09-03 19:49:36,580 INFO L226 Difference]: Without dead ends: 301 [2019-09-03 19:49:36,585 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:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-03 19:49:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-09-03 19:49:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-03 19:49:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-09-03 19:49:36,644 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-09-03 19:49:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,645 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-09-03 19:49:36,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-09-03 19:49:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:36,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,647 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-09-03 19:49:36,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,716 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,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:36,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:36,720 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-09-03 19:49:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,146 INFO L93 Difference]: Finished difference Result 301 states and 364 transitions. [2019-09-03 19:49:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:37,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,151 INFO L225 Difference]: With dead ends: 301 [2019-09-03 19:49:37,152 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 19:49:37,153 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:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 19:49:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 19:49:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 19:49:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-09-03 19:49:37,169 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-09-03 19:49:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,169 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-09-03 19:49:37,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-09-03 19:49:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 19:49:37,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,178 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:37,179 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-09-03 19:49:37,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:40,547 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,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:40,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-03 19:49:40,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:49:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:49:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:49:40,553 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-09-03 19:49:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:42,315 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2019-09-03 19:49:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:49:42,315 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-03 19:49:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:42,318 INFO L225 Difference]: With dead ends: 297 [2019-09-03 19:49:42,319 INFO L226 Difference]: Without dead ends: 295 [2019-09-03 19:49:42,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:49:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-03 19:49:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-03 19:49:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-03 19:49:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-09-03 19:49:42,333 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-09-03 19:49:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:42,335 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-09-03 19:49:42,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:49:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-09-03 19:49:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-03 19:49:42,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:42,340 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:42,340 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-09-03 19:49:42,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:42,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:42,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:43,411 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:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:49:43,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:49:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:49:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:43,413 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-09-03 19:49:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,104 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-09-03 19:49:44,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:44,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-03 19:49:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,109 INFO L225 Difference]: With dead ends: 296 [2019-09-03 19:49:44,109 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 19:49:44,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:49:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 19:49:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-03 19:49:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-03 19:49:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-09-03 19:49:44,120 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-09-03 19:49:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,121 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-09-03 19:49:44,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:49:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-09-03 19:49:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:49:44,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,126 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, 1, 1, 1] [2019-09-03 19:49:44,126 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-09-03 19:49:44,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-03 19:49:46,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:49:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:49:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:49:46,896 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-09-03 19:49:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:48,778 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-09-03 19:49:48,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:49:48,779 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-03 19:49:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:48,782 INFO L225 Difference]: With dead ends: 295 [2019-09-03 19:49:48,782 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 19:49:48,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:49:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 19:49:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-03 19:49:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-03 19:49:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-09-03 19:49:48,798 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-09-03 19:49:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:48,800 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-09-03 19:49:48,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:49:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-09-03 19:49:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-03 19:49:48,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:48,820 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, 1, 1, 1, 1] [2019-09-03 19:49:48,821 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-09-03 19:49:48,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:48,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:49,756 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:49,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:49,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:49:49,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:49:49,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:49:49,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:49,758 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-09-03 19:49:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:50,451 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2019-09-03 19:49:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:50,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-03 19:49:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:50,455 INFO L225 Difference]: With dead ends: 290 [2019-09-03 19:49:50,455 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 19:49:50,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:49:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 19:49:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-03 19:49:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-03 19:49:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-09-03 19:49:50,463 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-09-03 19:49:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:50,464 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-09-03 19:49:50,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:49:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-09-03 19:49:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-03 19:49:50,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:50,468 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, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:50,468 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-09-03 19:49:50,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:50,756 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:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:50,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:50,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:50,758 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 5 states. [2019-09-03 19:49:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:51,052 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-09-03 19:49:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:51,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-09-03 19:49:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:51,060 INFO L225 Difference]: With dead ends: 288 [2019-09-03 19:49:51,060 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 19:49:51,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 19:49:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-09-03 19:49:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-03 19:49:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-03 19:49:51,070 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-09-03 19:49:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:51,071 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-03 19:49:51,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-03 19:49:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-03 19:49:51,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:51,077 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:51,078 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-09-03 19:49:51,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:51,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:51,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:51,240 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:51,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:51,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:51,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:51,243 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-09-03 19:49:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:51,618 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-09-03 19:49:51,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:51,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-03 19:49:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:51,621 INFO L225 Difference]: With dead ends: 286 [2019-09-03 19:49:51,622 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 19:49:51,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 19:49:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-03 19:49:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-03 19:49:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-03 19:49:51,629 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-09-03 19:49:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:51,629 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-03 19:49:51,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-03 19:49:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 19:49:51,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:51,632 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:51,633 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-09-03 19:49:51,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:51,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:51,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:51,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:54,300 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:54,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:54,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-03 19:49:54,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:49:54,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:49:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:49:54,303 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-09-03 19:49:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:56,079 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2019-09-03 19:49:56,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:49:56,079 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-09-03 19:49:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:56,082 INFO L225 Difference]: With dead ends: 292 [2019-09-03 19:49:56,082 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 19:49:56,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:49:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 19:49:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-09-03 19:49:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 19:49:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-09-03 19:49:56,090 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-09-03 19:49:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:56,091 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-09-03 19:49:56,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:49:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-09-03 19:49:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 19:49:56,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:56,093 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:56,094 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-09-03 19:49:56,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:58,734 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:58,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:58,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-03 19:49:58,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:49:58,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:49:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:49:58,737 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-09-03 19:50:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:00,629 INFO L93 Difference]: Finished difference Result 298 states and 303 transitions. [2019-09-03 19:50:00,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:50:00,630 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-09-03 19:50:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:00,632 INFO L225 Difference]: With dead ends: 298 [2019-09-03 19:50:00,632 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 19:50:00,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:50:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 19:50:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-09-03 19:50:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-03 19:50:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-09-03 19:50:00,640 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-09-03 19:50:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:00,641 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-09-03 19:50:00,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:50:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-09-03 19:50:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:50:00,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:00,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:00,646 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:00,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-09-03 19:50:00,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:00,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:00,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:00,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:03,290 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:50:03,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:03,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-03 19:50:03,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:50:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:50:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:50:03,293 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-09-03 19:50:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:05,094 INFO L93 Difference]: Finished difference Result 301 states and 306 transitions. [2019-09-03 19:50:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:50:05,095 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-09-03 19:50:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:05,098 INFO L225 Difference]: With dead ends: 301 [2019-09-03 19:50:05,098 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 19:50:05,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:50:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 19:50:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-09-03 19:50:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-03 19:50:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-09-03 19:50:05,109 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-09-03 19:50:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:05,110 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-09-03 19:50:05,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:50:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-09-03 19:50:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:50:05,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:05,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:05,112 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-09-03 19:50:05,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:05,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:05,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:05,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:05,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:05,981 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:50:05,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:05,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:05,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:05,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:05,982 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 6 states. [2019-09-03 19:50:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:06,565 INFO L93 Difference]: Finished difference Result 276 states and 279 transitions. [2019-09-03 19:50:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:50:06,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-03 19:50:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:06,569 INFO L225 Difference]: With dead ends: 276 [2019-09-03 19:50:06,569 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 19:50:06,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 19:50:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-03 19:50:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-03 19:50:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2019-09-03 19:50:06,575 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 258 [2019-09-03 19:50:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:06,576 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2019-09-03 19:50:06,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2019-09-03 19:50:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 19:50:06,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:06,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:06,579 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash -607235764, now seen corresponding path program 1 times [2019-09-03 19:50:06,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:06,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:07,411 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:50:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:07,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:07,413 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 6 states. [2019-09-03 19:50:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:08,102 INFO L93 Difference]: Finished difference Result 282 states and 287 transitions. [2019-09-03 19:50:08,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:50:08,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-03 19:50:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:08,105 INFO L225 Difference]: With dead ends: 282 [2019-09-03 19:50:08,105 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 19:50:08,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:50:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 19:50:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2019-09-03 19:50:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-03 19:50:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-09-03 19:50:08,112 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 258 [2019-09-03 19:50:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:08,112 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-09-03 19:50:08,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-09-03 19:50:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-03 19:50:08,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:08,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:08,115 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash -153040543, now seen corresponding path program 1 times [2019-09-03 19:50:08,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,846 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:50:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:08,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:08,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:08,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:08,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:08,848 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 6 states. [2019-09-03 19:50:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:09,514 INFO L93 Difference]: Finished difference Result 285 states and 290 transitions. [2019-09-03 19:50:09,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:50:09,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-03 19:50:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:09,517 INFO L225 Difference]: With dead ends: 285 [2019-09-03 19:50:09,517 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 19:50:09,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:50:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 19:50:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2019-09-03 19:50:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-03 19:50:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-09-03 19:50:09,525 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2019-09-03 19:50:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:09,525 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-09-03 19:50:09,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-09-03 19:50:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 19:50:09,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:09,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:09,528 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:09,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 562136719, now seen corresponding path program 1 times [2019-09-03 19:50:09,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:09,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:09,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:09,858 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:50:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:09,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:09,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:09,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:09,860 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 6 states. [2019-09-03 19:50:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:10,139 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-09-03 19:50:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:50:10,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-09-03 19:50:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:10,141 INFO L225 Difference]: With dead ends: 268 [2019-09-03 19:50:10,141 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 19:50:10,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 19:50:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-09-03 19:50:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 19:50:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-09-03 19:50:10,150 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 260 [2019-09-03 19:50:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:10,151 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-09-03 19:50:10,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-09-03 19:50:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 19:50:10,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:10,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:10,158 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 246374009, now seen corresponding path program 1 times [2019-09-03 19:50:10,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:10,297 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:50:10,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:10,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:50:10,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:50:10,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:50:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:50:10,301 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 4 states. [2019-09-03 19:50:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:10,642 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2019-09-03 19:50:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:50:10,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-03 19:50:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:10,643 INFO L225 Difference]: With dead ends: 266 [2019-09-03 19:50:10,643 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:50:10,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:50:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:50:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:50:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:50:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:50:10,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-09-03 19:50:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:10,648 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:50:10,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:50:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:50:10,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:50:10,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:50:10,898 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:50:10,898 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:50:10,898 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:10,898 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:10,898 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:50:10,898 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L960(lines 960 984) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L4065(lines 4065 4983) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 5187) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 5296) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L3801(lines 3801 5006) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L1489(lines 1489 5210) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L3537(lines 3537 5029) no Hoare annotation was computed. [2019-09-03 19:50:10,899 INFO L443 ceAbstractionStarter]: For program point L4462(lines 4462 4949) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L1225(lines 1225 5233) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L2150(lines 2150 5153) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L2943(lines 2943 2954) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L4859(lines 4859 4869) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L3340(lines 3340 3364) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1052) no Hoare annotation was computed. [2019-09-03 19:50:10,900 INFO L443 ceAbstractionStarter]: For program point L4133(lines 4133 4977) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L439 ceAbstractionStarter]: At program point L4926(lines 4660 4933) 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:50:10,901 INFO L443 ceAbstractionStarter]: For program point L1821(lines 1821 5181) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L3869(lines 3869 5000) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 586) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L1557(lines 1557 5204) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L3605(lines 3605 5023) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L4530(lines 4530 4943) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 5227) no Hoare annotation was computed. [2019-09-03 19:50:10,901 INFO L443 ceAbstractionStarter]: For program point L2218(lines 2218 5147) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L3011(lines 3011 3022) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L4861(line 4861) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L439 ceAbstractionStarter]: At program point L501(lines 355 549) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L3408(lines 3408 3432) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L1096(lines 1096 1120) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L4201(lines 4201 4971) no Hoare annotation was computed. [2019-09-03 19:50:10,902 INFO L443 ceAbstractionStarter]: For program point L1889(lines 1889 5175) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L3937(lines 3937 4994) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L1625(lines 1625 5198) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L3673(lines 3673 5017) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L4598(lines 4598 4937) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 456) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L1361(lines 1361 5221) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point L2286(lines 2286 5141) no Hoare annotation was computed. [2019-09-03 19:50:10,903 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4673) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L3079(lines 3079 3090) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 778) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L4797(lines 4797 4832) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L3476(lines 3476 3500) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L1164(lines 1164 1188) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 114) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L4269(lines 4269 4965) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L1957(lines 1957 5169) no Hoare annotation was computed. [2019-09-03 19:50:10,904 INFO L443 ceAbstractionStarter]: For program point L4005(lines 4005 4988) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 5192) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L3741(lines 3741 5011) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L1429(lines 1429 5215) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 392) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L2354(lines 2354 5135) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L3147(lines 3147 3158) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L835(lines 835 846) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4806) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L3544(lines 3544 3568) no Hoare annotation was computed. [2019-09-03 19:50:10,905 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L1232(lines 1232 1256) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L4337(lines 4337 4959) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L2025(lines 2025 5163) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L4073(lines 4073 4982) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 5186) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L3809(lines 3809 5005) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L439 ceAbstractionStarter]: At program point L638(lines 123 640) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 5209) no Hoare annotation was computed. [2019-09-03 19:50:10,906 INFO L443 ceAbstractionStarter]: For program point L2422(lines 2422 5129) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L3215(lines 3215 3226) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 914) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L3612(lines 3612 3636) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1324) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 250) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L4405(lines 4405 4953) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L2093(lines 2093 5157) no Hoare annotation was computed. [2019-09-03 19:50:10,907 INFO L443 ceAbstractionStarter]: For program point L4141(lines 4141 4976) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point L1829(lines 1829 5180) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point L3877(lines 3877 4999) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L439 ceAbstractionStarter]: At program point L4868(lines 4725 4917) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~271 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~273 0)) (not (= main_~__VERIFIER_assert__cond~270 0)) (not (= main_~__VERIFIER_assert__cond~272 0)) (<= 61 main_~main__t~0)) [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point L4736(lines 4736 4758) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point L1565(lines 1565 5203) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4709) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point L2490(lines 2490 5123) no Hoare annotation was computed. [2019-09-03 19:50:10,908 INFO L443 ceAbstractionStarter]: For program point L3283(lines 3283 3294) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 54) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L3680(lines 3680 3704) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L4671(lines 4671 4931) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L1368(lines 1368 1392) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L4473(lines 4473 4947) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L2161(lines 2161 5151) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L4209(lines 4209 4970) no Hoare annotation was computed. [2019-09-03 19:50:10,909 INFO L443 ceAbstractionStarter]: For program point L1897(lines 1897 5174) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L3945(lines 3945 4993) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4861) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L4738(line 4738) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L4804(lines 4804 4826) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 5197) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L2558(lines 2558 5117) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L3351(lines 3351 3362) no Hoare annotation was computed. [2019-09-03 19:50:10,910 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1050) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L3748(lines 3748 3772) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L577(lines 577 584) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L4673(line 4673) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L1436(lines 1436 1460) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L4541(lines 4541 4941) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 5145) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L4277(lines 4277 4964) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L1965(lines 1965 5168) no Hoare annotation was computed. [2019-09-03 19:50:10,911 INFO L443 ceAbstractionStarter]: For program point L4013(lines 4013 4987) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L4806(line 4806) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 5191) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 5111) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 546) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L3419(lines 3419 3430) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1118) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L3816(lines 3816 3840) no Hoare annotation was computed. [2019-09-03 19:50:10,912 INFO L443 ceAbstractionStarter]: For program point L1504(lines 1504 1528) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 454) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L4609(lines 4609 4935) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 5139) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L4345(lines 4345 4958) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L2033(lines 2033 5162) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L4081(lines 4081 4981) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L1769(lines 1769 5185) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 5105) no Hoare annotation was computed. [2019-09-03 19:50:10,913 INFO L443 ceAbstractionStarter]: For program point L3487(lines 3487 3498) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1186) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L3884(lines 3884 3908) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1596) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L2365(lines 2365 5133) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L4413(lines 4413 4952) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 5156) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4975) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L1837(lines 1837 5179) no Hoare annotation was computed. [2019-09-03 19:50:10,914 INFO L443 ceAbstractionStarter]: For program point L2762(lines 2762 5099) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L3555(lines 3555 3566) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1254) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L3952(lines 3952 3976) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1664) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L2433(lines 2433 5127) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L4481(lines 4481 4946) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4849) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L2169(lines 2169 5150) no Hoare annotation was computed. [2019-09-03 19:50:10,915 INFO L443 ceAbstractionStarter]: For program point L4217(lines 4217 4969) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L1905(lines 1905 5173) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L2830(lines 2830 5093) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L3623(lines 3623 3634) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L1311(lines 1311 1322) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L4020(lines 4020 4044) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L4879(lines 4879 4914) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L1708(lines 1708 1732) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 539) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L2501(lines 2501 5121) no Hoare annotation was computed. [2019-09-03 19:50:10,916 INFO L443 ceAbstractionStarter]: For program point L4549(lines 4549 4940) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L2237(lines 2237 5144) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 640) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L4285(lines 4285 4963) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L1973(lines 1973 5167) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L2898(lines 2898 5087) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L3691(lines 3691 3702) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L4748(lines 4748 4756) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L1379(lines 1379 1390) no Hoare annotation was computed. [2019-09-03 19:50:10,917 INFO L443 ceAbstractionStarter]: For program point L4088(lines 4088 4112) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L1776(lines 1776 1800) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L4683(lines 4683 4929) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L2569(lines 2569 5115) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L4617(lines 4617 4934) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L2305(lines 2305 5138) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L4353(lines 4353 4957) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L2041(lines 2041 5161) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L2966(lines 2966 5081) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L4750(line 4750) no Hoare annotation was computed. [2019-09-03 19:50:10,918 INFO L443 ceAbstractionStarter]: For program point L654(lines 654 5285) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L3759(lines 3759 3770) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L4816(lines 4816 4824) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4818) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L4156(lines 4156 4180) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L1844(lines 1844 1868) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L2637(lines 2637 5109) no Hoare annotation was computed. [2019-09-03 19:50:10,919 INFO L443 ceAbstractionStarter]: For program point L4685(line 4685) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4790) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L2373(lines 2373 5132) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 594) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L4421(lines 4421 4951) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 600) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L2109(lines 2109 5155) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L3034(lines 3034 5075) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L4818(line 4818) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L722(lines 722 5279) no Hoare annotation was computed. [2019-09-03 19:50:10,920 INFO L443 ceAbstractionStarter]: For program point L3827(lines 3827 3838) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1526) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L4224(lines 4224 4248) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L1912(lines 1912 1936) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L2705(lines 2705 5103) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 5126) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L4489(lines 4489 4945) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L2177(lines 2177 5149) no Hoare annotation was computed. [2019-09-03 19:50:10,921 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 5287) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L3102(lines 3102 5069) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L4886(lines 4886 4908) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L790(lines 790 5273) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L3895(lines 3895 3906) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L439 ceAbstractionStarter]: At program point L592(lines 259 594) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L1583(lines 1583 1594) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L4292(lines 4292 4316) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L1980(lines 1980 2004) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L2773(lines 2773 5097) no Hoare annotation was computed. [2019-09-03 19:50:10,922 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 5120) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L4557(lines 4557 4939) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 553) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 5143) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L3170(lines 3170 5063) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L858(lines 858 5267) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L3963(lines 3963 3974) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L4888(line 4888) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1662) no Hoare annotation was computed. [2019-09-03 19:50:10,923 INFO L439 ceAbstractionStarter]: At program point L330(lines 263 553) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L4360(lines 4360 4384) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L2048(lines 2048 2072) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L2841(lines 2841 5091) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L2577(lines 2577 5114) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L4625(lines 4625 4933) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L2313(lines 2313 5137) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point L3238(lines 3238 5057) no Hoare annotation was computed. [2019-09-03 19:50:10,924 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4778) no Hoare annotation was computed. [2019-09-03 19:50:10,925 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 5261) no Hoare annotation was computed. [2019-09-03 19:50:10,925 INFO L443 ceAbstractionStarter]: For program point L4031(lines 4031 4042) no Hoare annotation was computed. [2019-09-03 19:50:10,925 INFO L443 ceAbstractionStarter]: For program point L1719(lines 1719 1730) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 537) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L4692(lines 4692 4928) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L4428(lines 4428 4452) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 189) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L2116(lines 2116 2140) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L2909(lines 2909 5085) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L2645(lines 2645 5108) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 547) no Hoare annotation was computed. [2019-09-03 19:50:10,926 INFO L443 ceAbstractionStarter]: For program point L2381(lines 2381 5131) no Hoare annotation was computed. [2019-09-03 19:50:10,927 INFO L443 ceAbstractionStarter]: For program point L3306(lines 3306 5051) no Hoare annotation was computed. [2019-09-03 19:50:10,927 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 598) no Hoare annotation was computed. [2019-09-03 19:50:10,927 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 5255) no Hoare annotation was computed. [2019-09-03 19:50:10,927 INFO L443 ceAbstractionStarter]: For program point L4099(lines 4099 4110) no Hoare annotation was computed. [2019-09-03 19:50:10,929 INFO L443 ceAbstractionStarter]: For program point L1787(lines 1787 1798) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L439 ceAbstractionStarter]: At program point L4694(lines 26 5288) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point L4496(lines 4496 4520) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point L2184(lines 2184 2208) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 644) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point L2977(lines 2977 5079) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 5283) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2713 5102) no Hoare annotation was computed. [2019-09-03 19:50:10,930 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4888) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L2449(lines 2449 5125) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L3374(lines 3374 5045) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 5296) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 5249) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L4167(lines 4167 4178) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L1855(lines 1855 1866) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L4564(lines 4564 4588) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 325) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2276) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L3045(lines 3045 5073) no Hoare annotation was computed. [2019-09-03 19:50:10,931 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 5277) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L2781(lines 2781 5096) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 5119) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 506) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L3442(lines 3442 5039) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L4235(lines 4235 4246) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 5243) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L446 ceAbstractionStarter]: At program point L5292(lines 22 5295) the Hoare annotation is: true [2019-09-03 19:50:10,932 INFO L443 ceAbstractionStarter]: For program point L1923(lines 1923 1934) no Hoare annotation was computed. [2019-09-03 19:50:10,932 INFO L439 ceAbstractionStarter]: At program point L470(lines 403 506) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,933 INFO L443 ceAbstractionStarter]: For program point L4632(lines 4632 4656) no Hoare annotation was computed. [2019-09-03 19:50:10,933 INFO L443 ceAbstractionStarter]: For program point L2320(lines 2320 2344) no Hoare annotation was computed. [2019-09-03 19:50:10,933 INFO L443 ceAbstractionStarter]: For program point L3113(lines 3113 5067) no Hoare annotation was computed. [2019-09-03 19:50:10,933 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 5271) no Hoare annotation was computed. [2019-09-03 19:50:10,933 INFO L443 ceAbstractionStarter]: For program point L2849(lines 2849 5090) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L4765(lines 4765 4915) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L2585(lines 2585 5113) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L3510(lines 3510 5033) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 551) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L4303(lines 4303 4314) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L1198(lines 1198 5237) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L1991(lines 1991 2002) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L4898(lines 4898 4906) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L4700(lines 4700 4927) no Hoare annotation was computed. [2019-09-03 19:50:10,934 INFO L443 ceAbstractionStarter]: For program point L2388(lines 2388 2412) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4685) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L3181(lines 3181 5061) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 5265) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L2917(lines 2917 5084) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4721) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L2653(lines 2653 5107) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L3578(lines 3578 5027) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L4371(lines 4371 4382) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 5231) no Hoare annotation was computed. [2019-09-03 19:50:10,935 INFO L443 ceAbstractionStarter]: For program point L2059(lines 2059 2070) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 639) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L2456(lines 2456 2480) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L3249(lines 3249 5055) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 5259) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L2985(lines 2985 5078) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 5282) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L2721(lines 2721 5101) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L3646(lines 3646 5021) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point L4769(lines 4769 4873) no Hoare annotation was computed. [2019-09-03 19:50:10,936 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4750) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L4439(lines 4439 4450) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 5225) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 187) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L2127(lines 2127 2138) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L2524(lines 2524 2548) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 465) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 596) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L3317(lines 3317 5049) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 5253) no Hoare annotation was computed. [2019-09-03 19:50:10,937 INFO L443 ceAbstractionStarter]: For program point L3053(lines 3053 5072) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 5276) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L2789(lines 2789 5095) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L3714(lines 3714 5015) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L4507(lines 4507 4518) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 5219) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L2195(lines 2195 2206) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 642) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L2592(lines 2592 2616) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L3385(lines 3385 5043) no Hoare annotation was computed. [2019-09-03 19:50:10,938 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 5247) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L3121(lines 3121 5066) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 5270) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L2857(lines 2857 5089) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L3782(lines 3782 5009) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L4707(lines 4707 4919) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L439 ceAbstractionStarter]: At program point L545(lines 399 547) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L4575(lines 4575 4586) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 504) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L1470(lines 1470 5213) no Hoare annotation was computed. [2019-09-03 19:50:10,939 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 323) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L2263(lines 2263 2274) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L2660(lines 2660 2684) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L3453(lines 3453 5037) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L1141(lines 1141 5241) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L3189(lines 3189 5060) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L877(lines 877 5264) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L2925(lines 2925 5083) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L3850(lines 3850 5003) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 633) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L4643(lines 4643 4654) no Hoare annotation was computed. [2019-09-03 19:50:10,940 INFO L443 ceAbstractionStarter]: For program point L4709(line 4709) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 5207) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L2331(lines 2331 2342) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L2728(lines 2728 2752) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L4776(lines 4776 4835) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L3521(lines 3521 5031) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 549) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L1209(lines 1209 5235) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L3257(lines 3257 5054) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L945(lines 945 5258) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L2993(lines 2993 5077) no Hoare annotation was computed. [2019-09-03 19:50:10,941 INFO L443 ceAbstractionStarter]: For program point L3918(lines 3918 4997) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 5281) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 5201) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L2399(lines 2399 2410) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 186) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L2796(lines 2796 2820) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L4778(line 4778) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L3589(lines 3589 5025) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 5229) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L3325(lines 3325 5048) no Hoare annotation was computed. [2019-09-03 19:50:10,942 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 5295) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L1013(lines 1013 5252) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L3061(lines 3061 5071) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L3986(lines 3986 4991) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 5275) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L1674(lines 1674 5195) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 2478) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 641) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L2864(lines 2864 2888) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L3657(lines 3657 5019) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L1345(lines 1345 5223) no Hoare annotation was computed. [2019-09-03 19:50:10,943 INFO L443 ceAbstractionStarter]: For program point L3393(lines 3393 5042) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 5246) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L3129(lines 3129 5065) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L4054(lines 4054 4985) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 5269) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L4847(lines 4847 4871) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L439 ceAbstractionStarter]: At program point L4913(lines 4765 4915) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~271 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~273 0)) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (not (= main_~__VERIFIER_assert__cond~270 0)) (not (= main_~__VERIFIER_assert__cond~272 0)) (<= 61 main_~main__t~0)) [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 5189) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L2535(lines 2535 2546) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L421(lines 421 463) no Hoare annotation was computed. [2019-09-03 19:50:10,944 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 322) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L2932(lines 2932 2956) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L3725(lines 3725 5013) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 5217) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L3461(lines 3461 5036) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 5240) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L3197(lines 3197 5059) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L4122(lines 4122 4979) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 5288) no Hoare annotation was computed. [2019-09-03 19:50:10,945 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 5263) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L1810(lines 1810 5183) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L4849(line 4849) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L2603(lines 2603 2614) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 595) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L3000(lines 3000 3024) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 712) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L3793(lines 3793 5007) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L1481(lines 1481 5211) no Hoare annotation was computed. [2019-09-03 19:50:10,946 INFO L443 ceAbstractionStarter]: For program point L3529(lines 3529 5030) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L1217(lines 1217 5234) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 180) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L3265(lines 3265 5053) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L4190(lines 4190 4973) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 5257) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 5177) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L4719(lines 4719 4917) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L2671(lines 2671 2682) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L439 ceAbstractionStarter]: At program point L4653(lines 63 5287) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L3068(lines 3068 3092) no Hoare annotation was computed. [2019-09-03 19:50:10,947 INFO L443 ceAbstractionStarter]: For program point L756(lines 756 780) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L3861(lines 3861 5001) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 631) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L1549(lines 1549 5205) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L3597(lines 3597 5024) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 5228) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L3333(lines 3333 5047) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L4258(lines 4258 4967) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 116) no Hoare annotation was computed. [2019-09-03 19:50:10,948 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 5296) the Hoare annotation is: true [2019-09-03 19:50:10,948 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 5251) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L1946(lines 1946 5171) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L2739(lines 2739 2750) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 593) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L4721(line 4721) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4738) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 848) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L3929(lines 3929 4995) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L4788(lines 4788 4833) no Hoare annotation was computed. [2019-09-03 19:50:10,949 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 5199) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L3665(lines 3665 5018) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 5222) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 316) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L3401(lines 3401 5041) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L4326(lines 4326 4961) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L1089(lines 1089 5245) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L2014(lines 2014 5165) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L2807(lines 2807 2818) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 462) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L3204(lines 3204 3228) no Hoare annotation was computed. [2019-09-03 19:50:10,950 INFO L443 ceAbstractionStarter]: For program point L892(lines 892 916) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L3997(lines 3997 4989) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L4790(line 4790) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 5193) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L3733(lines 3733 5012) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L1421(lines 1421 5216) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L3469(lines 3469 5035) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L4394(lines 4394 4955) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 252) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 5239) no Hoare annotation was computed. [2019-09-03 19:50:10,951 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 56) no Hoare annotation was computed. [2019-09-03 19:50:10,952 INFO L443 ceAbstractionStarter]: For program point L2082(lines 2082 5159) no Hoare annotation was computed. [2019-09-03 19:50:10,952 INFO L443 ceAbstractionStarter]: For program point L2875(lines 2875 2886) no Hoare annotation was computed. [2019-09-03 19:50:10,952 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 548) no Hoare annotation was computed. [2019-09-03 19:50:10,952 INFO L443 ceAbstractionStarter]: For program point L3272(lines 3272 3296) no Hoare annotation was computed. [2019-09-03 19:50:10,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:50:10 BoogieIcfgContainer [2019-09-03 19:50:10,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:50:10,982 INFO L168 Benchmark]: Toolchain (without parser) took 40196.35 ms. Allocated memory was 140.0 MB in the beginning and 847.2 MB in the end (delta: 707.3 MB). Free memory was 85.1 MB in the beginning and 474.5 MB in the end (delta: -389.4 MB). Peak memory consumption was 317.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:10,985 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:50:10,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1399.99 ms. Allocated memory was 140.0 MB in the beginning and 220.7 MB in the end (delta: 80.7 MB). Free memory was 84.7 MB in the beginning and 165.2 MB in the end (delta: -80.5 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:10,992 INFO L168 Benchmark]: Boogie Preprocessor took 213.35 ms. Allocated memory is still 220.7 MB. Free memory was 165.2 MB in the beginning and 157.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:10,992 INFO L168 Benchmark]: RCFGBuilder took 2502.65 ms. Allocated memory was 220.7 MB in the beginning and 269.0 MB in the end (delta: 48.2 MB). Free memory was 157.5 MB in the beginning and 201.8 MB in the end (delta: -44.3 MB). Peak memory consumption was 128.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:10,994 INFO L168 Benchmark]: TraceAbstraction took 36072.41 ms. Allocated memory was 269.0 MB in the beginning and 847.2 MB in the end (delta: 578.3 MB). Free memory was 201.8 MB in the beginning and 474.5 MB in the end (delta: -272.7 MB). Peak memory consumption was 305.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:11,002 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 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1399.99 ms. Allocated memory was 140.0 MB in the beginning and 220.7 MB in the end (delta: 80.7 MB). Free memory was 84.7 MB in the beginning and 165.2 MB in the end (delta: -80.5 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.35 ms. Allocated memory is still 220.7 MB. Free memory was 165.2 MB in the beginning and 157.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2502.65 ms. Allocated memory was 220.7 MB in the beginning and 269.0 MB in the end (delta: 48.2 MB). Free memory was 157.5 MB in the beginning and 201.8 MB in the end (delta: -44.3 MB). Peak memory consumption was 128.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36072.41 ms. Allocated memory was 269.0 MB in the beginning and 847.2 MB in the end (delta: 578.3 MB). Free memory was 201.8 MB in the beginning and 474.5 MB in the end (delta: -272.7 MB). Peak memory consumption was 305.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: 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: 4660]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 59 <= main__t) && !(main__t == main__tagbuf_len) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4725]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 4765]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(main__t == main__tagbuf_len)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 480 locations, 16 error locations. SAFE Result, 35.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1858 SDtfs, 41258 SDslu, 1956 SDs, 0 SdLazy, 9416 SolverSat, 10611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 643 SyntacticMatches, 307 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 18 NumberOfFragments, 96 HoareAnnotationTreeSize, 16 FomulaSimplifications, 2231 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 873 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 3604 NumberOfCodeBlocks, 3604 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 3599162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...