java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:40:29,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:40:29,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:40:29,769 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:40:29,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:40:29,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:40:29,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:40:29,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:40:29,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:40:29,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:40:29,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:40:29,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:40:29,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:40:29,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:40:29,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:40:29,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:40:29,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:40:29,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:40:29,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:40:29,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:40:29,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:40:29,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:40:29,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:40:29,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:40:29,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:40:29,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:40:29,811 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:40:29,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:40:29,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:40:29,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:40:29,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:40:29,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:40:29,819 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:40:29,819 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:40:29,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:40:29,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:40:29,821 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:40:29,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:40:29,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:40:29,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:40:29,849 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:40:29,849 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:40:29,849 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:40:29,849 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:40:29,850 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:40:29,850 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:40:29,850 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:40:29,851 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:40:29,851 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:40:29,851 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:40:29,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:40:29,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:40:29,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:40:29,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:40:29,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:40:29,853 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:40:29,853 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:40:29,853 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:40:29,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:40:29,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:40:29,854 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:40:29,854 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:40:29,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:29,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:40:29,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:40:29,855 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:40:29,856 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:40:29,856 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:40:29,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:40:29,857 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:40:29,857 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:40:29,857 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:40:29,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:40:29,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:40:29,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:40:29,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:40:29,941 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:40:29,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-12 20:40:30,004 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b4ea0f9/1aaa3ca88b86444383e596e4fc964ac7/FLAG975dc7230 [2018-11-12 20:40:30,479 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:40:30,480 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-12 20:40:30,497 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b4ea0f9/1aaa3ca88b86444383e596e4fc964ac7/FLAG975dc7230 [2018-11-12 20:40:30,512 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b4ea0f9/1aaa3ca88b86444383e596e4fc964ac7 [2018-11-12 20:40:30,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:40:30,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:40:30,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:30,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:40:30,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:40:30,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:30" (1/1) ... [2018-11-12 20:40:30,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6e4021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:30, skipping insertion in model container [2018-11-12 20:40:30,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:30" (1/1) ... [2018-11-12 20:40:30,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:40:30,598 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:40:30,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:30,935 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:40:31,059 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:31,074 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:40:31,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31 WrapperNode [2018-11-12 20:40:31,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:31,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:31,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:40:31,076 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:40:31,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:31,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:40:31,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:40:31,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:40:31,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (1/1) ... [2018-11-12 20:40:31,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:40:31,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:40:31,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:40:31,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:40:31,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (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 [2018-11-12 20:40:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:40:31,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:40:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:40:31,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:40:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:40:31,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:40:32,389 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:40:32,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:32 BoogieIcfgContainer [2018-11-12 20:40:32,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:40:32,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:40:32,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:40:32,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:40:32,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:40:30" (1/3) ... [2018-11-12 20:40:32,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca8a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:32, skipping insertion in model container [2018-11-12 20:40:32,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:31" (2/3) ... [2018-11-12 20:40:32,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca8a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:32, skipping insertion in model container [2018-11-12 20:40:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:32" (3/3) ... [2018-11-12 20:40:32,398 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-11-12 20:40:32,407 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:40:32,415 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-12 20:40:32,430 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-12 20:40:32,464 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:40:32,464 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:40:32,464 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:40:32,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:40:32,465 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:40:32,466 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:40:32,466 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:40:32,466 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:40:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-12 20:40:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:40:32,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:32,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:32,501 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:32,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2018-11-12 20:40:32,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:32,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:32,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:32,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:40:32,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:32,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:40:32,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:40:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:40:32,820 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2018-11-12 20:40:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:33,719 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2018-11-12 20:40:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:40:33,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-12 20:40:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:33,734 INFO L225 Difference]: With dead ends: 135 [2018-11-12 20:40:33,734 INFO L226 Difference]: Without dead ends: 118 [2018-11-12 20:40:33,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-12 20:40:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-12 20:40:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-12 20:40:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-12 20:40:33,788 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2018-11-12 20:40:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:33,788 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-12 20:40:33,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:40:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-12 20:40:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:40:33,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:33,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:33,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:33,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2018-11-12 20:40:33,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:33,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:33,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:33,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:33,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:33,930 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 6 states. [2018-11-12 20:40:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:34,587 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-11-12 20:40:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:34,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-12 20:40:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:34,591 INFO L225 Difference]: With dead ends: 118 [2018-11-12 20:40:34,591 INFO L226 Difference]: Without dead ends: 113 [2018-11-12 20:40:34,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-12 20:40:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-12 20:40:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-12 20:40:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-11-12 20:40:34,604 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2018-11-12 20:40:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:34,604 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-11-12 20:40:34,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-12 20:40:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:40:34,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:34,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:34,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:34,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2018-11-12 20:40:34,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:34,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:34,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:34,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:34,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:34,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:34,717 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 6 states. [2018-11-12 20:40:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:35,410 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-11-12 20:40:35,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:35,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-12 20:40:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:35,414 INFO L225 Difference]: With dead ends: 148 [2018-11-12 20:40:35,414 INFO L226 Difference]: Without dead ends: 146 [2018-11-12 20:40:35,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-12 20:40:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 111. [2018-11-12 20:40:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-12 20:40:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-11-12 20:40:35,426 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-11-12 20:40:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:35,426 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-11-12 20:40:35,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-12 20:40:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:40:35,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:35,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:35,428 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:35,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2018-11-12 20:40:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:35,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:35,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:35,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:35,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:35,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:35,524 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 6 states. [2018-11-12 20:40:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:35,914 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-11-12 20:40:35,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:35,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-12 20:40:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:35,917 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:40:35,918 INFO L226 Difference]: Without dead ends: 138 [2018-11-12 20:40:35,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-12 20:40:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2018-11-12 20:40:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-12 20:40:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-11-12 20:40:35,928 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2018-11-12 20:40:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:35,928 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-11-12 20:40:35,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-11-12 20:40:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:40:35,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:35,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:35,930 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:35,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:35,931 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2018-11-12 20:40:35,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:36,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:36,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:36,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:36,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:36,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:36,033 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2018-11-12 20:40:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:36,436 INFO L93 Difference]: Finished difference Result 172 states and 191 transitions. [2018-11-12 20:40:36,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:36,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-12 20:40:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:36,438 INFO L225 Difference]: With dead ends: 172 [2018-11-12 20:40:36,438 INFO L226 Difference]: Without dead ends: 170 [2018-11-12 20:40:36,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-12 20:40:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2018-11-12 20:40:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-12 20:40:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-11-12 20:40:36,447 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2018-11-12 20:40:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:36,448 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-11-12 20:40:36,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-11-12 20:40:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:40:36,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:36,449 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:36,450 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:36,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2018-11-12 20:40:36,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:36,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:36,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:36,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:36,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:36,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:36,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:36,533 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-11-12 20:40:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:36,860 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-12 20:40:36,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:36,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-12 20:40:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:36,863 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:40:36,863 INFO L226 Difference]: Without dead ends: 130 [2018-11-12 20:40:36,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-12 20:40:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2018-11-12 20:40:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-12 20:40:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-11-12 20:40:36,870 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2018-11-12 20:40:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:36,871 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-11-12 20:40:36,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-11-12 20:40:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:36,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:36,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:36,873 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:36,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2018-11-12 20:40:36,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:36,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:37,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:37,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:37,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:37,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:37,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:37,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:37,138 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 8 states. [2018-11-12 20:40:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:37,639 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-11-12 20:40:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:37,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-12 20:40:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:37,642 INFO L225 Difference]: With dead ends: 120 [2018-11-12 20:40:37,642 INFO L226 Difference]: Without dead ends: 118 [2018-11-12 20:40:37,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-12 20:40:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-11-12 20:40:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-12 20:40:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-11-12 20:40:37,649 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2018-11-12 20:40:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:37,650 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-11-12 20:40:37,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-12 20:40:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:37,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:37,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:37,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:37,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2018-11-12 20:40:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:37,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:37,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:37,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:37,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:37,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:37,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:37,735 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2018-11-12 20:40:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:38,677 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2018-11-12 20:40:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:38,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-12 20:40:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:38,680 INFO L225 Difference]: With dead ends: 162 [2018-11-12 20:40:38,680 INFO L226 Difference]: Without dead ends: 160 [2018-11-12 20:40:38,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-12 20:40:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2018-11-12 20:40:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:40:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-11-12 20:40:38,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2018-11-12 20:40:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:38,689 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-11-12 20:40:38,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-12 20:40:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:40:38,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:38,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:38,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:38,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2018-11-12 20:40:38,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:38,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:38,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:38,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:38,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:38,941 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 8 states. [2018-11-12 20:40:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:39,456 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-12 20:40:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:39,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-12 20:40:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:39,458 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:40:39,458 INFO L226 Difference]: Without dead ends: 95 [2018-11-12 20:40:39,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-12 20:40:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-12 20:40:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-12 20:40:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-12 20:40:39,465 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2018-11-12 20:40:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:39,465 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-12 20:40:39,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-12 20:40:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:40:39,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:39,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:39,467 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:39,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2018-11-12 20:40:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:39,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:39,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:39,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:39,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:39,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:39,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:39,706 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 8 states. [2018-11-12 20:40:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:40,234 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-11-12 20:40:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:40,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-12 20:40:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:40,236 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:40:40,236 INFO L226 Difference]: Without dead ends: 109 [2018-11-12 20:40:40,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-12 20:40:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2018-11-12 20:40:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-12 20:40:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-11-12 20:40:40,243 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2018-11-12 20:40:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:40,243 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-11-12 20:40:40,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-11-12 20:40:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:40:40,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:40,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:40,245 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:40,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2018-11-12 20:40:40,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:40,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:40,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:40:40,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:40,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:40:40,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:40:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:40,354 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2018-11-12 20:40:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:40,851 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-12 20:40:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:40,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-12 20:40:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:40,854 INFO L225 Difference]: With dead ends: 108 [2018-11-12 20:40:40,854 INFO L226 Difference]: Without dead ends: 106 [2018-11-12 20:40:40,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-12 20:40:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-11-12 20:40:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-12 20:40:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-11-12 20:40:40,860 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2018-11-12 20:40:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:40,861 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-11-12 20:40:40,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:40:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-11-12 20:40:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:40:40,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:40,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:40,863 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:40,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2018-11-12 20:40:40,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:40,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:40,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:40,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:40,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:40,930 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 6 states. [2018-11-12 20:40:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:41,517 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-11-12 20:40:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:41,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-12 20:40:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:41,520 INFO L225 Difference]: With dead ends: 104 [2018-11-12 20:40:41,520 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:40:41,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:40:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-12 20:40:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-12 20:40:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-12 20:40:41,524 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2018-11-12 20:40:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:41,524 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-12 20:40:41,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-12 20:40:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-12 20:40:41,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:41,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:41,527 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:41,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2018-11-12 20:40:41,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:41,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:41,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:40:41,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:41,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:40:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:40:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:41,650 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 7 states. [2018-11-12 20:40:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:41,810 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-12 20:40:41,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:41,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-12 20:40:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:41,812 INFO L225 Difference]: With dead ends: 67 [2018-11-12 20:40:41,812 INFO L226 Difference]: Without dead ends: 65 [2018-11-12 20:40:41,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-12 20:40:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-11-12 20:40:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-12 20:40:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-12 20:40:41,815 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2018-11-12 20:40:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:41,815 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-12 20:40:41,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:40:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-12 20:40:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-12 20:40:41,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:41,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:41,817 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:41,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2018-11-12 20:40:41,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:41,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:41,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:42,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:42,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:40:42,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:42,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:40:42,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:40:42,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:42,206 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 7 states. [2018-11-12 20:40:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:42,360 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-12 20:40:42,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:42,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-12 20:40:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:42,362 INFO L225 Difference]: With dead ends: 56 [2018-11-12 20:40:42,362 INFO L226 Difference]: Without dead ends: 54 [2018-11-12 20:40:42,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-12 20:40:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-12 20:40:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:40:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-12 20:40:42,366 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2018-11-12 20:40:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:42,366 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-12 20:40:42,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:40:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-12 20:40:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:42,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:42,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:42,368 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:42,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2018-11-12 20:40:42,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:42,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:42,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:42,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:42,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:42,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:42,498 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-11-12 20:40:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:42,704 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-12 20:40:42,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:42,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-12 20:40:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:42,706 INFO L225 Difference]: With dead ends: 62 [2018-11-12 20:40:42,706 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:40:42,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:40:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:40:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-12 20:40:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-12 20:40:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-12 20:40:42,710 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-12 20:40:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:42,710 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-12 20:40:42,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-12 20:40:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:42,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:42,711 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:42,712 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:42,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2018-11-12 20:40:42,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:42,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:42,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:42,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:43,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:43,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:40:43,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:43,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:40:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:40:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:43,055 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-11-12 20:40:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:43,262 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-12 20:40:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:43,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-12 20:40:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:43,263 INFO L225 Difference]: With dead ends: 52 [2018-11-12 20:40:43,263 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:40:43,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:40:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:40:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:40:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:40:43,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-12 20:40:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:43,266 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:40:43,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:40:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:40:43,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:40:43,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:40:43,629 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-12 20:40:43,814 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-12 20:40:43,829 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:40:43,830 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:40:43,830 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:40:43,830 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:40:43,830 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:40:43,830 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2018-11-12 20:40:43,831 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2018-11-12 20:40:43,832 INFO L421 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2018-11-12 20:40:43,833 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L421 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2018-11-12 20:40:43,834 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L428 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-12 20:40:43,835 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2018-11-12 20:40:43,836 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2018-11-12 20:40:43,836 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2018-11-12 20:40:43,836 INFO L425 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2018-11-12 20:40:43,836 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 20:40:43,836 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2018-11-12 20:40:43,836 INFO L421 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~14 1) (<= 1 main_~main__t~0)) [2018-11-12 20:40:43,836 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2018-11-12 20:40:43,837 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2018-11-12 20:40:43,838 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L421 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2018-11-12 20:40:43,839 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-12 20:40:43,840 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2018-11-12 20:40:43,841 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2018-11-12 20:40:43,842 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2018-11-12 20:40:43,843 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2018-11-12 20:40:43,844 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2018-11-12 20:40:43,844 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2018-11-12 20:40:43,844 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2018-11-12 20:40:43,844 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2018-11-12 20:40:43,844 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2018-11-12 20:40:43,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:40:43 BoogieIcfgContainer [2018-11-12 20:40:43,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:40:43,861 INFO L168 Benchmark]: Toolchain (without parser) took 13337.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 861.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -667.1 MB). Peak memory consumption was 194.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:43,862 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:40:43,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:43,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:40:43,863 INFO L168 Benchmark]: Boogie Preprocessor took 148.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:43,864 INFO L168 Benchmark]: RCFGBuilder took 1140.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:43,865 INFO L168 Benchmark]: TraceAbstraction took 11469.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.5 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 186.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:43,870 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 549.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 25.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1140.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11469.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 129.5 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 186.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 11.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 530 SDtfs, 3153 SDslu, 1131 SDs, 0 SdLazy, 3796 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 284 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 40 HoareAnnotationTreeSize, 9 FomulaSimplifications, 60910 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 21650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...