/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:22:15,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:22:15,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:22:15,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:22:15,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:22:15,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:22:15,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:22:15,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:22:15,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:22:15,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:22:15,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:22:15,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:22:15,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:22:15,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:22:15,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:22:15,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:22:15,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:22:15,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:22:15,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:22:15,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:22:15,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:22:15,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:22:15,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:22:15,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:22:15,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:22:15,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:22:15,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:22:15,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:22:15,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:22:15,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:22:15,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:22:15,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:22:15,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:22:15,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:22:15,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:22:15,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:22:15,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:22:15,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:22:15,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:22:15,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:22:15,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:22:15,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:22:15,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:22:15,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:22:15,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:22:15,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:22:15,582 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:22:15,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:22:15,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:22:15,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:22:15,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:22:15,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:22:15,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:22:15,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:22:15,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:22:15,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:22:15,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:22:15,584 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:22:15,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:22:15,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:22:15,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:22:15,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:22:15,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:22:15,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:15,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:22:15,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:22:15,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:22:15,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:22:15,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:22:15,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:22:15,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:22:15,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:22:15,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:22:15,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:22:15,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:22:15,905 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:22:15,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-06 21:22:15,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22085c20a/c8583822fd7c424489b59f82b3cad63e/FLAG0e4f78817 [2019-11-06 21:22:16,517 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:22:16,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-06 21:22:16,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22085c20a/c8583822fd7c424489b59f82b3cad63e/FLAG0e4f78817 [2019-11-06 21:22:16,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22085c20a/c8583822fd7c424489b59f82b3cad63e [2019-11-06 21:22:16,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:22:16,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:22:16,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:16,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:22:16,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:22:16,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:16" (1/1) ... [2019-11-06 21:22:16,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f83f60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:16, skipping insertion in model container [2019-11-06 21:22:16,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:16" (1/1) ... [2019-11-06 21:22:16,915 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:22:16,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:22:17,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:17,285 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:22:17,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:17,495 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:22:17,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17 WrapperNode [2019-11-06 21:22:17,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:17,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:22:17,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:22:17,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:22:17,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... [2019-11-06 21:22:17,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:22:17,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:22:17,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:22:17,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:22:17,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:22:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:22:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:22:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:22:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:22:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:22:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:22:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:22:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:22:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:22:18,340 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:22:18,341 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:22:18,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:18 BoogieIcfgContainer [2019-11-06 21:22:18,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:22:18,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:22:18,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:22:18,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:22:18,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:16" (1/3) ... [2019-11-06 21:22:18,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48222fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:18, skipping insertion in model container [2019-11-06 21:22:18,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:17" (2/3) ... [2019-11-06 21:22:18,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48222fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:18, skipping insertion in model container [2019-11-06 21:22:18,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:18" (3/3) ... [2019-11-06 21:22:18,353 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-11-06 21:22:18,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:22:18,378 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-06 21:22:18,389 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-06 21:22:18,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:22:18,434 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:22:18,434 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:22:18,434 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:22:18,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:22:18,435 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:22:18,435 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:22:18,435 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:22:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-06 21:22:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 21:22:18,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:18,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:18,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-11-06 21:22:18,474 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:18,474 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296942861] [2019-11-06 21:22:18,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:18,683 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296942861] [2019-11-06 21:22:18,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:18,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:18,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873871303] [2019-11-06 21:22:18,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:18,692 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:18,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:18,711 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 5 states. [2019-11-06 21:22:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:19,418 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2019-11-06 21:22:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:19,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-06 21:22:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:19,433 INFO L225 Difference]: With dead ends: 143 [2019-11-06 21:22:19,433 INFO L226 Difference]: Without dead ends: 123 [2019-11-06 21:22:19,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-06 21:22:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-11-06 21:22:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-06 21:22:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-11-06 21:22:19,503 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-11-06 21:22:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:19,504 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-11-06 21:22:19,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-11-06 21:22:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-06 21:22:19,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:19,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:19,507 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:19,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-11-06 21:22:19,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:19,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712571368] [2019-11-06 21:22:19,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:19,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712571368] [2019-11-06 21:22:19,634 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:19,634 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:19,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900791630] [2019-11-06 21:22:19,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:19,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:19,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:19,637 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 5 states. [2019-11-06 21:22:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:20,044 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2019-11-06 21:22:20,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:20,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-06 21:22:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:20,047 INFO L225 Difference]: With dead ends: 121 [2019-11-06 21:22:20,048 INFO L226 Difference]: Without dead ends: 113 [2019-11-06 21:22:20,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-06 21:22:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-06 21:22:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-06 21:22:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-11-06 21:22:20,078 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-11-06 21:22:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:20,078 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-11-06 21:22:20,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-11-06 21:22:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:22:20,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:20,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:20,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-11-06 21:22:20,084 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:20,084 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837996544] [2019-11-06 21:22:20,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:20,216 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837996544] [2019-11-06 21:22:20,216 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:20,216 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:20,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898523160] [2019-11-06 21:22:20,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:20,219 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:20,220 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 6 states. [2019-11-06 21:22:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:20,586 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-11-06 21:22:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:20,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-06 21:22:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:20,588 INFO L225 Difference]: With dead ends: 113 [2019-11-06 21:22:20,588 INFO L226 Difference]: Without dead ends: 111 [2019-11-06 21:22:20,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-06 21:22:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-06 21:22:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-06 21:22:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-11-06 21:22:20,598 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-11-06 21:22:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:20,598 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-11-06 21:22:20,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-11-06 21:22:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:20,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:20,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:20,600 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-11-06 21:22:20,601 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:20,601 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36318013] [2019-11-06 21:22:20,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:20,683 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36318013] [2019-11-06 21:22:20,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:20,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:20,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853073404] [2019-11-06 21:22:20,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:20,685 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:20,685 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 5 states. [2019-11-06 21:22:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:20,978 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-11-06 21:22:20,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:20,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:22:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:20,981 INFO L225 Difference]: With dead ends: 111 [2019-11-06 21:22:20,981 INFO L226 Difference]: Without dead ends: 107 [2019-11-06 21:22:20,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-06 21:22:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-06 21:22:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-06 21:22:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-11-06 21:22:20,990 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-11-06 21:22:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:20,991 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-11-06 21:22:20,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-11-06 21:22:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:20,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:20,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:20,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-11-06 21:22:20,993 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:20,994 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819170032] [2019-11-06 21:22:20,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:21,062 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819170032] [2019-11-06 21:22:21,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:21,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:21,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984213236] [2019-11-06 21:22:21,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:21,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:21,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:21,064 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2019-11-06 21:22:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:21,430 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-06 21:22:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:21,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:21,436 INFO L225 Difference]: With dead ends: 125 [2019-11-06 21:22:21,437 INFO L226 Difference]: Without dead ends: 123 [2019-11-06 21:22:21,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-06 21:22:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-11-06 21:22:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-06 21:22:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-11-06 21:22:21,445 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-11-06 21:22:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:21,445 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-11-06 21:22:21,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-11-06 21:22:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:21,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:21,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:21,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-11-06 21:22:21,448 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:21,448 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771940557] [2019-11-06 21:22:21,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:21,512 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771940557] [2019-11-06 21:22:21,512 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:21,512 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:21,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156449462] [2019-11-06 21:22:21,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:21,513 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:21,514 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2019-11-06 21:22:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:21,801 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-11-06 21:22:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:21,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:21,803 INFO L225 Difference]: With dead ends: 105 [2019-11-06 21:22:21,803 INFO L226 Difference]: Without dead ends: 103 [2019-11-06 21:22:21,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-06 21:22:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-06 21:22:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-06 21:22:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-11-06 21:22:21,809 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-11-06 21:22:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:21,810 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-11-06 21:22:21,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-11-06 21:22:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:21,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:21,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:21,811 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-11-06 21:22:21,815 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:21,815 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161147097] [2019-11-06 21:22:21,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:21,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161147097] [2019-11-06 21:22:21,899 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:21,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:21,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519414065] [2019-11-06 21:22:21,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:21,903 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:21,904 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 6 states. [2019-11-06 21:22:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:22,280 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-11-06 21:22:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:22,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:22,287 INFO L225 Difference]: With dead ends: 120 [2019-11-06 21:22:22,287 INFO L226 Difference]: Without dead ends: 118 [2019-11-06 21:22:22,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-06 21:22:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-11-06 21:22:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-06 21:22:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-06 21:22:22,293 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-11-06 21:22:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:22,293 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-06 21:22:22,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-06 21:22:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:22,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:22,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:22,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-11-06 21:22:22,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:22,296 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046630597] [2019-11-06 21:22:22,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:22,355 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046630597] [2019-11-06 21:22:22,355 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,356 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:22,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035104907] [2019-11-06 21:22:22,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:22,356 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:22,357 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-11-06 21:22:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:22,679 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-11-06 21:22:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:22,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:22,681 INFO L225 Difference]: With dead ends: 120 [2019-11-06 21:22:22,681 INFO L226 Difference]: Without dead ends: 118 [2019-11-06 21:22:22,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-06 21:22:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-11-06 21:22:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-06 21:22:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-11-06 21:22:22,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-11-06 21:22:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:22,688 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-11-06 21:22:22,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-11-06 21:22:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:22,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:22,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:22,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-11-06 21:22:22,691 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:22,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160920407] [2019-11-06 21:22:22,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:22,778 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160920407] [2019-11-06 21:22:22,778 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,778 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:22,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810413652] [2019-11-06 21:22:22,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:22,779 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:22,780 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 6 states. [2019-11-06 21:22:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,085 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-11-06 21:22:23,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:23,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,086 INFO L225 Difference]: With dead ends: 99 [2019-11-06 21:22:23,086 INFO L226 Difference]: Without dead ends: 95 [2019-11-06 21:22:23,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-06 21:22:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-06 21:22:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-06 21:22:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-06 21:22:23,093 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-11-06 21:22:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,094 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-06 21:22:23,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-06 21:22:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:23,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,095 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-11-06 21:22:23,096 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,096 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718187520] [2019-11-06 21:22:23,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:23,210 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718187520] [2019-11-06 21:22:23,210 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:23,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212235398] [2019-11-06 21:22:23,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:23,212 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:23,213 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2019-11-06 21:22:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,611 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2019-11-06 21:22:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:23,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 21:22:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,619 INFO L225 Difference]: With dead ends: 111 [2019-11-06 21:22:23,619 INFO L226 Difference]: Without dead ends: 109 [2019-11-06 21:22:23,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-06 21:22:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-11-06 21:22:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-06 21:22:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-11-06 21:22:23,624 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-11-06 21:22:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,625 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-11-06 21:22:23,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-11-06 21:22:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:22:23,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,627 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-11-06 21:22:23,627 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,627 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485312789] [2019-11-06 21:22:23,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:23,686 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485312789] [2019-11-06 21:22:23,686 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,687 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:23,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762545449] [2019-11-06 21:22:23,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:23,687 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:23,688 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2019-11-06 21:22:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,008 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2019-11-06 21:22:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:24,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 21:22:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,009 INFO L225 Difference]: With dead ends: 103 [2019-11-06 21:22:24,009 INFO L226 Difference]: Without dead ends: 101 [2019-11-06 21:22:24,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:22:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-06 21:22:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-11-06 21:22:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-06 21:22:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-06 21:22:24,014 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-11-06 21:22:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,014 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-06 21:22:24,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-06 21:22:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:22:24,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:24,016 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-11-06 21:22:24,017 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,017 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845525337] [2019-11-06 21:22:24,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:24,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845525337] [2019-11-06 21:22:24,056 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,057 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:24,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917503468] [2019-11-06 21:22:24,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:24,057 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:24,058 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2019-11-06 21:22:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,293 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-11-06 21:22:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:24,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-06 21:22:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,294 INFO L225 Difference]: With dead ends: 91 [2019-11-06 21:22:24,294 INFO L226 Difference]: Without dead ends: 58 [2019-11-06 21:22:24,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-06 21:22:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-06 21:22:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:22:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-11-06 21:22:24,298 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-11-06 21:22:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,298 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-11-06 21:22:24,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-11-06 21:22:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 21:22:24,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,302 INFO L410 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] [2019-11-06 21:22:24,303 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-11-06 21:22:24,303 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,303 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618914624] [2019-11-06 21:22:24,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:24,536 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618914624] [2019-11-06 21:22:24,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-06 21:22:24,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660010567] [2019-11-06 21:22:24,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:22:24,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:22:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:22:24,538 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 14 states. [2019-11-06 21:22:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,904 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-11-06 21:22:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:22:24,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-11-06 21:22:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,906 INFO L225 Difference]: With dead ends: 67 [2019-11-06 21:22:24,906 INFO L226 Difference]: Without dead ends: 65 [2019-11-06 21:22:24,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:22:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-06 21:22:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-11-06 21:22:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 21:22:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-11-06 21:22:24,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-11-06 21:22:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,910 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-11-06 21:22:24,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:22:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-11-06 21:22:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 21:22:24,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,912 INFO L410 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] [2019-11-06 21:22:24,912 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-11-06 21:22:24,913 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,913 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017367428] [2019-11-06 21:22:24,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:25,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017367428] [2019-11-06 21:22:25,103 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,103 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-06 21:22:25,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267358401] [2019-11-06 21:22:25,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:22:25,106 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:22:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:22:25,107 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 14 states. [2019-11-06 21:22:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,453 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-06 21:22:25,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:22:25,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-11-06 21:22:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,455 INFO L225 Difference]: With dead ends: 56 [2019-11-06 21:22:25,455 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:22:25,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:22:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:22:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-06 21:22:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:22:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-11-06 21:22:25,460 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-11-06 21:22:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,460 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-11-06 21:22:25,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:22:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-11-06 21:22:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 21:22:25,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,462 INFO L410 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] [2019-11-06 21:22:25,462 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-11-06 21:22:25,463 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,463 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611083407] [2019-11-06 21:22:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:25,707 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611083407] [2019-11-06 21:22:25,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:25,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936386284] [2019-11-06 21:22:25,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:25,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:25,709 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 6 states. [2019-11-06 21:22:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,906 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-11-06 21:22:25,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:25,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-06 21:22:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,907 INFO L225 Difference]: With dead ends: 62 [2019-11-06 21:22:25,907 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 21:22:25,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 26 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 21:22:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-11-06 21:22:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:22:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-06 21:22:25,912 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-11-06 21:22:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,913 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-06 21:22:25,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-06 21:22:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 21:22:25,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,916 INFO L410 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] [2019-11-06 21:22:25,916 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-11-06 21:22:25,917 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,917 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288923896] [2019-11-06 21:22:25,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:26,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288923896] [2019-11-06 21:22:26,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243780028] [2019-11-06 21:22:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,112 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 6 states. [2019-11-06 21:22:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,277 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-11-06 21:22:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:26,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-06 21:22:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,278 INFO L225 Difference]: With dead ends: 52 [2019-11-06 21:22:26,278 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:22:26,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 26 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:22:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:22:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:22:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:22:26,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-11-06 21:22:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,280 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:22:26,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:22:26,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:22:26,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:22:26,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:26,440 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:22:26,441 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-06 21:22:26,441 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-06 21:22:26,442 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L439 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)) [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-11-06 21:22:26,443 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-11-06 21:22:26,444 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L439 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)) [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L439 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: (or (and (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) (<= 0 main_~main__t~0)) [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-11-06 21:22:26,445 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-11-06 21:22:26,446 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2019-11-06 21:22:26,446 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-11-06 21:22:26,447 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-11-06 21:22:26,448 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L439 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)) [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: (and (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-06 21:22:26,449 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-06 21:22:26,450 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-11-06 21:22:26,451 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-11-06 21:22:26,452 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-11-06 21:22:26,453 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-11-06 21:22:26,454 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-11-06 21:22:26,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:22:26 BoogieIcfgContainer [2019-11-06 21:22:26,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:22:26,478 INFO L168 Benchmark]: Toolchain (without parser) took 9579.77 ms. Allocated memory was 145.2 MB in the beginning and 315.6 MB in the end (delta: 170.4 MB). Free memory was 102.8 MB in the beginning and 192.3 MB in the end (delta: -89.5 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:26,479 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 21:22:26,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.11 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 102.4 MB in the beginning and 175.8 MB in the end (delta: -73.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:26,480 INFO L168 Benchmark]: Boogie Preprocessor took 55.15 ms. Allocated memory is still 201.9 MB. Free memory was 175.8 MB in the beginning and 173.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:26,481 INFO L168 Benchmark]: RCFGBuilder took 790.71 ms. Allocated memory is still 201.9 MB. Free memory was 173.8 MB in the beginning and 125.1 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:26,482 INFO L168 Benchmark]: TraceAbstraction took 8132.07 ms. Allocated memory was 201.9 MB in the beginning and 315.6 MB in the end (delta: 113.8 MB). Free memory was 124.1 MB in the beginning and 192.3 MB in the end (delta: -68.3 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:26,485 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 597.11 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 102.4 MB in the beginning and 175.8 MB in the end (delta: -73.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.15 ms. Allocated memory is still 201.9 MB. Free memory was 175.8 MB in the beginning and 173.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 790.71 ms. Allocated memory is still 201.9 MB. Free memory was 173.8 MB in the beginning and 125.1 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8132.07 ms. Allocated memory was 201.9 MB in the beginning and 315.6 MB in the end (delta: 113.8 MB). Free memory was 124.1 MB in the beginning and 192.3 MB in the end (delta: -68.3 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: 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: 252]: 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: 264]: 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: 926]: 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: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: 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 - 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: ((((__tmp_2624_1 == \old(__tmp_2624_1) && __return_2598 == \old(__return_2598)) && __tmp_3137_1 == \old(__tmp_3137_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && __tmp_2624_0 == \old(__tmp_2624_0)) || 0 <= main__t - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= 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. Result: SAFE, OverallTime: 8.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 730 SDtfs, 2646 SDslu, 669 SDs, 0 SdLazy, 3510 SolverSat, 551 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 58 SyntacticMatches, 57 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 102 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 89 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1247 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 109 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 51812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...