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.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:58:57,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:58:57,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:58:57,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:58:57,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:58:57,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:58:57,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:58:57,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:58:57,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:58:57,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:58:57,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:58:57,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:58:57,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:58:57,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:58:57,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:58:57,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:58:57,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:58:57,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:58:57,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:58:57,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:58:57,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:58:57,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:58:57,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:58:57,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:58:57,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:58:57,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:58:57,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:58:57,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:58:57,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:58:57,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:58:57,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:58:57,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:58:57,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:58:57,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:58:57,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:58:57,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:58:57,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:58:57,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:58:57,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:58:57,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:58:57,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:58:57,749 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-05 11:58:57,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:58:57,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:58:57,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:58:57,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:58:57,780 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:58:57,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:58:57,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:58:57,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:58:57,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:58:57,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:58:57,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:58:57,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:58:57,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:58:57,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:58:57,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:58:57,783 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:58:57,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:58:57,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:58:57,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:58:57,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:58:57,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:58:57,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:58:57,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:58:57,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:58:57,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:58:57,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:58:57,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:58:57,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:58:57,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:58:57,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:58:57,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:58:57,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:58:57,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:58:57,837 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:58:57,838 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.v+lhb-reducer.c [2019-09-05 11:58:57,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509101900/6627497c68234657b217dd313f2e593e/FLAG924989ceb [2019-09-05 11:58:58,373 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:58:58,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-05 11:58:58,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509101900/6627497c68234657b217dd313f2e593e/FLAG924989ceb [2019-09-05 11:58:58,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509101900/6627497c68234657b217dd313f2e593e [2019-09-05 11:58:58,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:58:58,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:58:58,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:58,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:58:58,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:58:58,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:58" (1/1) ... [2019-09-05 11:58:58,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a71346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:58, skipping insertion in model container [2019-09-05 11:58:58,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:58" (1/1) ... [2019-09-05 11:58:58,723 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:58:58,760 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:58:59,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:59,025 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:58:59,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:59,168 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:58:59,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59 WrapperNode [2019-09-05 11:58:59,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:59,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:58:59,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:58:59,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:58:59,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (1/1) ... [2019-09-05 11:58:59,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:58:59,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:58:59,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:58:59,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:58:59,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (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-05 11:58:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:58:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:58:59,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:58:59,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:58:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:58:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:58:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:58:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:58:59,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:58:59,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:58:59,656 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:58:59,656 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 11:58:59,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:59 BoogieIcfgContainer [2019-09-05 11:58:59,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:58:59,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:58:59,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:58:59,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:58:59,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:58:58" (1/3) ... [2019-09-05 11:58:59,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee4fccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:59, skipping insertion in model container [2019-09-05 11:58:59,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:59" (2/3) ... [2019-09-05 11:58:59,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee4fccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:59, skipping insertion in model container [2019-09-05 11:58:59,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:59" (3/3) ... [2019-09-05 11:58:59,666 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-09-05 11:58:59,676 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:58:59,687 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-05 11:58:59,701 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-05 11:58:59,734 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:58:59,735 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:58:59,735 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:58:59,737 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:58:59,737 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:58:59,738 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:58:59,738 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:58:59,738 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:58:59,738 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:58:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-09-05 11:58:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:58:59,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:59,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:59,772 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-09-05 11:58:59,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:59,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:59,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:59,964 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-05 11:58:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:59,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:58:59,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:58:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:58:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:58:59,983 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-09-05 11:59:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:00,184 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2019-09-05 11:59:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:00,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 11:59:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:00,199 INFO L225 Difference]: With dead ends: 131 [2019-09-05 11:59:00,199 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 11:59:00,203 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-05 11:59:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 11:59:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-09-05 11:59:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 11:59:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-05 11:59:00,268 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-09-05 11:59:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:00,269 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-05 11:59:00,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-05 11:59:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:59:00,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:00,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:00,273 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-09-05 11:59:00,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:00,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:00,372 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-05 11:59:00,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:00,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:00,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:00,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:00,375 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-09-05 11:59:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:00,470 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-09-05 11:59:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:00,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 11:59:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:00,472 INFO L225 Difference]: With dead ends: 111 [2019-09-05 11:59:00,473 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 11:59:00,474 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-05 11:59:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 11:59:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-09-05 11:59:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 11:59:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-05 11:59:00,484 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-09-05 11:59:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:00,484 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-05 11:59:00,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-05 11:59:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:59:00,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:00,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:00,487 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-09-05 11:59:00,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:00,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:00,551 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-05 11:59:00,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:00,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:00,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:00,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:00,553 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-09-05 11:59:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:00,675 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-05 11:59:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:00,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 11:59:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:00,678 INFO L225 Difference]: With dead ends: 73 [2019-09-05 11:59:00,678 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 11:59:00,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 11:59:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-05 11:59:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 11:59:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-05 11:59:00,687 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-09-05 11:59:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:00,688 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-05 11:59:00,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-05 11:59:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:59:00,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:00,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:00,690 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-09-05 11:59:00,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:00,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:00,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:00,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:00,753 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-05 11:59:00,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:00,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:00,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:00,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:00,755 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-09-05 11:59:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:00,852 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-05 11:59:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:00,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 11:59:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:00,854 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:59:00,854 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:59:00,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:59:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-05 11:59:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 11:59:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-05 11:59:00,861 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-09-05 11:59:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:00,862 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-05 11:59:00,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-05 11:59:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:00,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:00,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:00,864 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-09-05 11:59:00,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:00,914 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-05 11:59:00,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:00,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:00,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:00,915 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-05 11:59:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:01,042 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-09-05 11:59:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:01,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 11:59:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:01,046 INFO L225 Difference]: With dead ends: 116 [2019-09-05 11:59:01,046 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 11:59:01,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 11:59:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-09-05 11:59:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 11:59:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-05 11:59:01,054 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-09-05 11:59:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:01,054 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-05 11:59:01,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-05 11:59:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:01,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:01,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:01,056 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-09-05 11:59:01,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:01,119 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-05 11:59:01,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:01,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:01,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:01,120 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-05 11:59:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:01,237 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-09-05 11:59:01,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:01,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 11:59:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:01,239 INFO L225 Difference]: With dead ends: 101 [2019-09-05 11:59:01,240 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 11:59:01,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 11:59:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-09-05 11:59:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 11:59:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-05 11:59:01,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-09-05 11:59:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:01,248 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-05 11:59:01,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-05 11:59:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:01,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:01,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:01,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-09-05 11:59:01,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:01,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:01,284 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-05 11:59:01,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:01,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:01,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:01,286 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-09-05 11:59:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:01,355 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-05 11:59:01,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:01,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 11:59:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:01,358 INFO L225 Difference]: With dead ends: 65 [2019-09-05 11:59:01,359 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 11:59:01,362 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-05 11:59:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 11:59:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-05 11:59:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 11:59:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-05 11:59:01,370 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-09-05 11:59:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:01,371 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-05 11:59:01,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-05 11:59:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:01,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:01,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:01,375 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-09-05 11:59:01,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:01,429 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-05 11:59:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:01,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:01,430 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-05 11:59:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:01,484 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-05 11:59:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:01,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 11:59:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:01,485 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:59:01,485 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:59:01,486 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-05 11:59:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:59:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-05 11:59:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:59:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-05 11:59:01,500 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-09-05 11:59:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:01,501 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-05 11:59:01,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-05 11:59:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:01,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:01,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:01,507 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-09-05 11:59:01,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:01,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:01,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:01,602 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-05 11:59:01,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:01,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:01,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:01,604 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-09-05 11:59:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:01,733 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-09-05 11:59:01,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:01,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:01,735 INFO L225 Difference]: With dead ends: 94 [2019-09-05 11:59:01,735 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 11:59:01,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 11:59:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-09-05 11:59:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 11:59:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-05 11:59:01,741 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-09-05 11:59:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:01,742 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-05 11:59:01,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-05 11:59:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:01,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:01,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:01,744 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-09-05 11:59:01,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:01,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:01,826 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-05 11:59:01,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:01,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:01,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:01,828 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-09-05 11:59:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:01,944 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-09-05 11:59:01,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:01,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:01,946 INFO L225 Difference]: With dead ends: 84 [2019-09-05 11:59:01,946 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 11:59:01,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 11:59:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-09-05 11:59:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 11:59:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-05 11:59:01,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-09-05 11:59:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:01,955 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-05 11:59:01,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-05 11:59:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:01,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:01,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:01,960 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-09-05 11:59:01,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:01,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,020 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-05 11:59:02,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:02,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:02,022 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-09-05 11:59:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,097 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-05 11:59:02,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:02,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,099 INFO L225 Difference]: With dead ends: 70 [2019-09-05 11:59:02,099 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 11:59:02,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 11:59:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-09-05 11:59:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 11:59:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-05 11:59:02,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-09-05 11:59:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,104 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-05 11:59:02,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-05 11:59:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:02,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,106 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-09-05 11:59:02,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,146 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-05 11:59:02,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:02,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:02,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:02,147 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-09-05 11:59:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,221 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-05 11:59:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:02,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,222 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:59:02,222 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 11:59:02,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 11:59:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-05 11:59:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 11:59:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-05 11:59:02,227 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-09-05 11:59:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,227 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-05 11:59:02,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-05 11:59:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:02,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,229 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-09-05 11:59:02,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,255 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-05 11:59:02,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:02,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:02,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:02,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:02,256 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-09-05 11:59:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,331 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-09-05 11:59:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:02,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,333 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:59:02,333 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:59:02,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:59:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-09-05 11:59:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 11:59:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-05 11:59:02,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-05 11:59:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,338 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-05 11:59:02,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-05 11:59:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:02,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,340 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-09-05 11:59:02,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,420 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-05 11:59:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:02,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:02,422 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-05 11:59:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,498 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-05 11:59:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:02,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,500 INFO L225 Difference]: With dead ends: 59 [2019-09-05 11:59:02,500 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:59:02,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:59:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-09-05 11:59:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:59:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 11:59:02,504 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-05 11:59:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,505 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 11:59:02,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 11:59:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:02,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,506 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-09-05 11:59:02,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,550 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-05 11:59:02,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:02,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:02,551 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-05 11:59:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,604 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-05 11:59:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:02,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,605 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:59:02,605 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:59:02,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:59:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-05 11:59:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:59:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 11:59:02,610 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-09-05 11:59:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,610 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 11:59:02,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 11:59:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:02,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,612 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-09-05 11:59:02,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,654 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-05 11:59:02,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:02,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:02,656 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-09-05 11:59:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,724 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-09-05 11:59:02,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:02,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 11:59:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,726 INFO L225 Difference]: With dead ends: 54 [2019-09-05 11:59:02,726 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 11:59:02,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 11:59:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-09-05 11:59:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:59:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 11:59:02,730 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-09-05 11:59:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,731 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 11:59:02,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 11:59:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:59:02,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,732 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-09-05 11:59:02,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:02,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:02,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:02,759 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-09-05 11:59:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,785 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-05 11:59:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:02,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-05 11:59:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,786 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:59:02,786 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:59:02,786 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-05 11:59:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:59:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 11:59:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:59:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 11:59:02,790 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-09-05 11:59:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,790 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 11:59:02,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 11:59:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:59:02,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:02,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:02,792 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-09-05 11:59:02,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:02,815 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-05 11:59:02,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:02,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:02,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:02,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:02,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:02,816 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-05 11:59:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:02,853 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-05 11:59:02,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:02,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-05 11:59:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:02,854 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:59:02,854 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:59:02,854 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-05 11:59:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:59:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:59:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:59:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:59:02,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-05 11:59:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:02,855 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:59:02,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:59:02,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:59:02,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:59:03,256 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 9 [2019-09-05 11:59:03,260 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:59:03,260 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:59:03,260 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:59:03,260 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:59:03,261 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:59:03,261 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:59:03,261 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:59:03,261 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-09-05 11:59:03,261 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-09-05 11:59:03,262 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-09-05 11:59:03,262 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-09-05 11:59:03,262 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-09-05 11:59:03,262 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-09-05 11:59:03,263 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-09-05 11:59:03,263 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-09-05 11:59:03,263 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-09-05 11:59:03,263 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-09-05 11:59:03,263 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-09-05 11:59:03,264 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-09-05 11:59:03,264 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-09-05 11:59:03,264 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-09-05 11:59:03,264 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-09-05 11:59:03,265 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-09-05 11:59:03,266 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-09-05 11:59:03,266 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-09-05 11:59:03,266 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-09-05 11:59:03,266 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-09-05 11:59:03,266 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-09-05 11:59:03,267 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-09-05 11:59:03,267 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 1 main_~main__t~0)) [2019-09-05 11:59:03,267 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-05 11:59:03,267 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-09-05 11:59:03,268 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-09-05 11:59:03,268 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-09-05 11:59:03,269 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-09-05 11:59:03,269 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-09-05 11:59:03,269 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2019-09-05 11:59:03,269 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-05 11:59:03,269 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-09-05 11:59:03,269 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-09-05 11:59:03,270 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-05 11:59:03,270 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-09-05 11:59:03,270 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-09-05 11:59:03,270 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-09-05 11:59:03,270 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-09-05 11:59:03,270 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-09-05 11:59:03,271 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-09-05 11:59:03,271 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-09-05 11:59:03,271 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-09-05 11:59:03,271 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-09-05 11:59:03,271 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-09-05 11:59:03,272 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 0 main_~main__t~0)) [2019-09-05 11:59:03,272 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-09-05 11:59:03,272 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-09-05 11:59:03,272 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-09-05 11:59:03,273 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-09-05 11:59:03,273 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-09-05 11:59:03,273 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-09-05 11:59:03,273 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-09-05 11:59:03,273 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-09-05 11:59:03,274 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-09-05 11:59:03,274 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-09-05 11:59:03,274 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-09-05 11:59:03,274 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-09-05 11:59:03,274 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-09-05 11:59:03,275 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-09-05 11:59:03,275 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-09-05 11:59:03,275 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-09-05 11:59:03,275 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-09-05 11:59:03,275 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-05 11:59:03,276 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-09-05 11:59:03,277 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-09-05 11:59:03,277 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-05 11:59:03,277 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-09-05 11:59:03,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:59:03 BoogieIcfgContainer [2019-09-05 11:59:03,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:59:03,312 INFO L168 Benchmark]: Toolchain (without parser) took 4602.82 ms. Allocated memory was 132.1 MB in the beginning and 263.2 MB in the end (delta: 131.1 MB). Free memory was 86.2 MB in the beginning and 204.1 MB in the end (delta: -118.0 MB). Peak memory consumption was 135.2 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:03,315 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 132.1 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-05 11:59:03,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.41 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.0 MB in the beginning and 174.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:03,322 INFO L168 Benchmark]: Boogie Preprocessor took 35.06 ms. Allocated memory is still 199.2 MB. Free memory was 174.9 MB in the beginning and 173.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:03,324 INFO L168 Benchmark]: RCFGBuilder took 452.12 ms. Allocated memory is still 199.2 MB. Free memory was 173.0 MB in the beginning and 148.4 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:03,325 INFO L168 Benchmark]: TraceAbstraction took 3649.38 ms. Allocated memory was 199.2 MB in the beginning and 263.2 MB in the end (delta: 64.0 MB). Free memory was 148.4 MB in the beginning and 204.1 MB in the end (delta: -55.7 MB). Peak memory consumption was 130.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:03,339 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.51 ms. Allocated memory is still 132.1 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 462.41 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.0 MB in the beginning and 174.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.06 ms. Allocated memory is still 199.2 MB. Free memory was 174.9 MB in the beginning and 173.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 452.12 ms. Allocated memory is still 199.2 MB. Free memory was 173.0 MB in the beginning and 148.4 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3649.38 ms. Allocated memory was 199.2 MB in the beginning and 263.2 MB in the end (delta: 64.0 MB). Free memory was 148.4 MB in the beginning and 204.1 MB in the end (delta: -55.7 MB). Peak memory consumption was 130.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 3.5s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 856 SDtfs, 1356 SDslu, 904 SDs, 0 SdLazy, 1024 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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, 18 MinimizatonAttempts, 311 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 9 FomulaSimplifications, 139433 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4869 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 10744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...