/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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:22:20,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:22:20,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:22:20,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:22:20,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:22:20,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:22:20,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:22:20,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:22:20,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:22:20,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:22:20,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:22:20,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:22:20,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:22:20,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:22:20,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:22:20,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:22:20,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:22:20,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:22:20,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:22:20,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:22:20,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:22:20,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:22:20,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:22:20,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:22:20,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:22:20,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:22:20,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:22:20,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:22:20,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:22:20,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:22:20,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:22:20,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:22:20,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:22:20,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:22:20,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:22:20,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:22:20,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:22:20,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:22:20,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:22:20,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:22:20,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:22:20,614 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:20,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:22:20,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:22:20,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:22:20,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:22:20,655 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:22:20,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:22:20,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:22:20,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:22:20,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:22:20,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:22:20,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:22:20,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:22:20,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:22:20,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:22:20,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:22:20,659 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:22:20,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:22:20,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:22:20,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:22:20,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:22:20,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:22:20,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:20,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:22:20,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:22:20,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:22:20,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:22:20,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:22:20,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:22:20,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:22:20,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:22:21,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:22:21,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:22:21,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:22:21,007 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:22:21,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-06 21:22:21,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54d3f386/e576437cf79f4e19b4bcf191e11109c8/FLAG34cd42937 [2019-11-06 21:22:21,517 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:22:21,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-06 21:22:21,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54d3f386/e576437cf79f4e19b4bcf191e11109c8/FLAG34cd42937 [2019-11-06 21:22:21,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54d3f386/e576437cf79f4e19b4bcf191e11109c8 [2019-11-06 21:22:21,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:22:21,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:22:21,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:21,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:22:21,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:22:21,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b20414e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21, skipping insertion in model container [2019-11-06 21:22:21,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:22:21,944 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:22:22,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:22,265 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:22:22,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:22,404 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:22:22,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:22 WrapperNode [2019-11-06 21:22:22,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:22,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:22:22,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:22:22,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:22:22,420 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:22" (1/1) ... [2019-11-06 21:22:22,420 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:22" (1/1) ... [2019-11-06 21:22:22,428 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:22" (1/1) ... [2019-11-06 21:22:22,428 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:22" (1/1) ... [2019-11-06 21:22:22,444 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:22" (1/1) ... [2019-11-06 21:22:22,453 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:22" (1/1) ... [2019-11-06 21:22:22,457 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:22" (1/1) ... [2019-11-06 21:22:22,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:22:22,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:22:22,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:22:22,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:22:22,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:22" (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:22,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:22:22,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:22:22,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:22:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:22:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:22:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:22:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:22:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:22:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:22:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:22:22,909 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:22:22,910 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:22:22,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:22 BoogieIcfgContainer [2019-11-06 21:22:22,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:22:22,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:22:22,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:22:22,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:22:22,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:21" (1/3) ... [2019-11-06 21:22:22,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a07037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:22, skipping insertion in model container [2019-11-06 21:22:22,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:22" (2/3) ... [2019-11-06 21:22:22,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a07037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:22, skipping insertion in model container [2019-11-06 21:22:22,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:22" (3/3) ... [2019-11-06 21:22:22,919 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-06 21:22:22,929 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:22:22,938 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-06 21:22:22,949 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-06 21:22:22,976 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:22:22,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:22:22,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:22:22,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:22:22,977 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:22:22,977 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:22:22,977 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:22:22,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:22:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-06 21:22:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-06 21:22:23,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-11-06 21:22:23,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025792448] [2019-11-06 21:22:23,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,282 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,283 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025792448] [2019-11-06 21:22:23,286 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,286 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:23,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265816648] [2019-11-06 21:22:23,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:23,297 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:23,315 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2019-11-06 21:22:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,771 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2019-11-06 21:22:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:23,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-06 21:22:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,786 INFO L225 Difference]: With dead ends: 137 [2019-11-06 21:22:23,786 INFO L226 Difference]: Without dead ends: 113 [2019-11-06 21:22:23,790 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:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-06 21:22:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-11-06 21:22:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-06 21:22:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-06 21:22:23,859 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-11-06 21:22:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,859 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-06 21:22:23,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-06 21:22:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-06 21:22:23,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,862 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,862 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-11-06 21:22:23,863 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,863 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263833047] [2019-11-06 21:22:23,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,928 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,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263833047] [2019-11-06 21:22:23,928 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,929 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:23,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042450058] [2019-11-06 21:22:23,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:23,931 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:23,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:23,932 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-11-06 21:22:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,109 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-06 21:22:24,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:24,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-06 21:22:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,113 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:24,113 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:24,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-06 21:22:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-06 21:22:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-06 21:22:24,137 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-11-06 21:22:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,137 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-06 21:22:24,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-06 21:22:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-06 21:22:24,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:24,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-11-06 21:22:24,141 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,141 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418779666] [2019-11-06 21:22:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,254 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,255 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418779666] [2019-11-06 21:22:24,255 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,255 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:24,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172061492] [2019-11-06 21:22:24,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:24,259 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:24,260 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-11-06 21:22:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,458 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-06 21:22:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:24,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-06 21:22:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,460 INFO L225 Difference]: With dead ends: 73 [2019-11-06 21:22:24,460 INFO L226 Difference]: Without dead ends: 71 [2019-11-06 21:22:24,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-06 21:22:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-11-06 21:22:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-06 21:22:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-06 21:22:24,470 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-11-06 21:22:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,470 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-06 21:22:24,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-06 21:22:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:22:24,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,471 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:24,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-11-06 21:22:24,473 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,473 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569519055] [2019-11-06 21:22:24,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,545 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,545 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569519055] [2019-11-06 21:22:24,545 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076026494] [2019-11-06 21:22:24,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,547 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2019-11-06 21:22:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,732 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-06 21:22:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:24,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-06 21:22:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,734 INFO L225 Difference]: With dead ends: 71 [2019-11-06 21:22:24,734 INFO L226 Difference]: Without dead ends: 69 [2019-11-06 21:22:24,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-06 21:22:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-06 21:22:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-06 21:22:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-06 21:22:24,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-11-06 21:22:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,744 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-06 21:22:24,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-06 21:22:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:22:24,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,746 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:24,747 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-11-06 21:22:24,747 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,748 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172835403] [2019-11-06 21:22:24,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,804 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,805 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172835403] [2019-11-06 21:22:24,805 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,805 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901961478] [2019-11-06 21:22:24,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,806 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,807 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2019-11-06 21:22:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,002 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-06 21:22:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:25,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-06 21:22:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,006 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:25,006 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:25,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-06 21:22:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-06 21:22:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-06 21:22:25,014 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-11-06 21:22:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,014 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-06 21:22:25,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-06 21:22:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:25,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,016 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:25,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-11-06 21:22:25,017 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,017 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90124085] [2019-11-06 21:22:25,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,124 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,125 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90124085] [2019-11-06 21:22:25,125 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,125 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:25,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958378079] [2019-11-06 21:22:25,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:25,126 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:25,127 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-11-06 21:22:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,357 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-11-06 21:22:25,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:25,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 21:22:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,359 INFO L225 Difference]: With dead ends: 112 [2019-11-06 21:22:25,359 INFO L226 Difference]: Without dead ends: 110 [2019-11-06 21:22:25,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-06 21:22:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-11-06 21:22:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-06 21:22:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-06 21:22:25,369 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-11-06 21:22:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,369 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-06 21:22:25,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-06 21:22:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:25,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,370 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:25,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-11-06 21:22:25,372 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,372 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820907528] [2019-11-06 21:22:25,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,433 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,433 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820907528] [2019-11-06 21:22:25,434 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,434 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:25,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194911006] [2019-11-06 21:22:25,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:25,437 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:25,438 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-06 21:22:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,573 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-06 21:22:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:25,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:22:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,575 INFO L225 Difference]: With dead ends: 65 [2019-11-06 21:22:25,575 INFO L226 Difference]: Without dead ends: 61 [2019-11-06 21:22:25,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-06 21:22:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-06 21:22:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 21:22:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-06 21:22:25,585 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-11-06 21:22:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,586 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-06 21:22:25,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-06 21:22:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:25,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,589 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:25,590 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-11-06 21:22:25,591 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,591 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533246776] [2019-11-06 21:22:25,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,648 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,649 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533246776] [2019-11-06 21:22:25,649 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,649 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:25,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002402564] [2019-11-06 21:22:25,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:25,650 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:25,651 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-06 21:22:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,748 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-06 21:22:25,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:25,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:22:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,749 INFO L225 Difference]: With dead ends: 61 [2019-11-06 21:22:25,749 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:22:25,749 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:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:22:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-06 21:22:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 21:22:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-06 21:22:25,755 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-11-06 21:22:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,756 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-06 21:22:25,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-06 21:22:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:25,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,757 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:25,758 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-11-06 21:22:25,758 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,758 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81428719] [2019-11-06 21:22:25,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,860 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,861 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81428719] [2019-11-06 21:22:25,861 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,861 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:25,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579909797] [2019-11-06 21:22:25,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:25,862 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:25,871 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2019-11-06 21:22:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,130 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-11-06 21:22:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:26,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,131 INFO L225 Difference]: With dead ends: 95 [2019-11-06 21:22:26,132 INFO L226 Difference]: Without dead ends: 93 [2019-11-06 21:22:26,132 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:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-06 21:22:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-11-06 21:22:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:22:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-06 21:22:26,137 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-11-06 21:22:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,137 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-06 21:22:26,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-06 21:22:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:26,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,138 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:26,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-11-06 21:22:26,139 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,139 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593308924] [2019-11-06 21:22:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:26,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593308924] [2019-11-06 21:22:26,183 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876975605] [2019-11-06 21:22:26,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,184 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,185 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2019-11-06 21:22:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,343 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-06 21:22:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:26,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,349 INFO L225 Difference]: With dead ends: 72 [2019-11-06 21:22:26,349 INFO L226 Difference]: Without dead ends: 70 [2019-11-06 21:22:26,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-06 21:22:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-06 21:22:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:22:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-06 21:22:26,356 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-11-06 21:22:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,356 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-06 21:22:26,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-06 21:22:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:26,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,357 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:26,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-11-06 21:22:26,359 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,359 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671762881] [2019-11-06 21:22:26,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,418 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,419 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671762881] [2019-11-06 21:22:26,419 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,419 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559050030] [2019-11-06 21:22:26,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,420 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,421 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2019-11-06 21:22:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,548 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-06 21:22:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:26,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,549 INFO L225 Difference]: With dead ends: 53 [2019-11-06 21:22:26,549 INFO L226 Difference]: Without dead ends: 51 [2019-11-06 21:22:26,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-06 21:22:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-06 21:22:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 21:22:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-06 21:22:26,559 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-11-06 21:22:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,559 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-06 21:22:26,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-06 21:22:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:26,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,560 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:26,561 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-11-06 21:22:26,561 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,562 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605832709] [2019-11-06 21:22:26,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,638 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,639 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605832709] [2019-11-06 21:22:26,639 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,639 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349427534] [2019-11-06 21:22:26,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,640 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,640 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-11-06 21:22:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,776 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-06 21:22:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:26,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,777 INFO L225 Difference]: With dead ends: 50 [2019-11-06 21:22:26,778 INFO L226 Difference]: Without dead ends: 48 [2019-11-06 21:22:26,778 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:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-06 21:22:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-06 21:22:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 21:22:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-06 21:22:26,783 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-11-06 21:22:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,783 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-06 21:22:26,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-06 21:22:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:26,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,784 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:26,785 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-11-06 21:22:26,785 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,785 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094762837] [2019-11-06 21:22:26,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,842 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,843 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094762837] [2019-11-06 21:22:26,843 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,843 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762226396] [2019-11-06 21:22:26,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,844 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,844 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-11-06 21:22:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,988 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-06 21:22:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:26,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,989 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:26,989 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:26,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-11-06 21:22:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 21:22:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-06 21:22:26,993 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-11-06 21:22:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,994 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-06 21:22:26,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-06 21:22:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:26,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,995 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:26,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-11-06 21:22:26,996 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,996 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537547872] [2019-11-06 21:22:26,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,054 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:27,054 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537547872] [2019-11-06 21:22:27,054 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,055 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:27,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479892553] [2019-11-06 21:22:27,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:27,055 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:27,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:27,056 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-11-06 21:22:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,270 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-11-06 21:22:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:27,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,272 INFO L225 Difference]: With dead ends: 57 [2019-11-06 21:22:27,272 INFO L226 Difference]: Without dead ends: 55 [2019-11-06 21:22:27,273 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:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-06 21:22:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-11-06 21:22:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 21:22:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-06 21:22:27,281 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-11-06 21:22:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,281 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-06 21:22:27,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-06 21:22:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:27,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:27,282 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:27,282 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-11-06 21:22:27,283 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:27,284 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893432647] [2019-11-06 21:22:27,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,383 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:27,383 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893432647] [2019-11-06 21:22:27,383 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,383 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:27,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869361888] [2019-11-06 21:22:27,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:27,385 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:27,386 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-11-06 21:22:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,512 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-11-06 21:22:27,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:27,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,513 INFO L225 Difference]: With dead ends: 41 [2019-11-06 21:22:27,513 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 21:22:27,513 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:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 21:22:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-06 21:22:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:22:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-06 21:22:27,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-11-06 21:22:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,520 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-06 21:22:27,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-06 21:22:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:27,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:27,522 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:27,522 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-11-06 21:22:27,523 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:27,523 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633053696] [2019-11-06 21:22:27,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,616 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:27,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633053696] [2019-11-06 21:22:27,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,617 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:27,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455857941] [2019-11-06 21:22:27,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:27,619 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:27,620 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-11-06 21:22:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,777 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-11-06 21:22:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:27,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 21:22:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,779 INFO L225 Difference]: With dead ends: 52 [2019-11-06 21:22:27,780 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 21:22:27,780 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:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 21:22:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-11-06 21:22:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 21:22:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-06 21:22:27,785 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-11-06 21:22:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,785 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-06 21:22:27,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-06 21:22:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:22:27,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:27,786 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:27,787 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-11-06 21:22:27,787 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:27,789 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550638000] [2019-11-06 21:22:27,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,851 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:27,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550638000] [2019-11-06 21:22:27,851 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,852 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:27,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925649575] [2019-11-06 21:22:27,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:27,854 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:27,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:27,854 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-11-06 21:22:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:28,013 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-11-06 21:22:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:28,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 21:22:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:28,016 INFO L225 Difference]: With dead ends: 56 [2019-11-06 21:22:28,016 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:22:28,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:22:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-11-06 21:22:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:22:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 21:22:28,021 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-06 21:22:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:28,022 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 21:22:28,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 21:22:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:22:28,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:28,023 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:28,023 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-11-06 21:22:28,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:28,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090139494] [2019-11-06 21:22:28,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:28,059 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:28,059 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090139494] [2019-11-06 21:22:28,060 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:28,060 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:28,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454384934] [2019-11-06 21:22:28,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:28,060 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:28,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:28,061 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-11-06 21:22:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:28,154 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-06 21:22:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:28,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-06 21:22:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:28,155 INFO L225 Difference]: With dead ends: 37 [2019-11-06 21:22:28,155 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:22:28,156 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:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:22:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:22:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:22:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:22:28,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-06 21:22:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:28,157 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:22:28,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:22:28,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:22:28,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:22:28,563 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,564 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= ~__return_305~0 |old(~__return_305~0)|) (= ~__tmp_247_0~0 |old(~__tmp_247_0~0)|)) [2019-11-06 21:22:28,564 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,564 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,564 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:22:28,565 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:22:28,565 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,566 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-06 21:22:28,566 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-06 21:22:28,566 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-11-06 21:22:28,566 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-06 21:22:28,566 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-06 21:22:28,567 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-06 21:22:28,567 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-06 21:22:28,567 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-06 21:22:28,567 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-06 21:22:28,567 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-06 21:22:28,568 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-06 21:22:28,568 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-06 21:22:28,568 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-06 21:22:28,568 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-06 21:22:28,568 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-06 21:22:28,569 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-06 21:22:28,569 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-06 21:22:28,569 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-06 21:22:28,569 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-06 21:22:28,569 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-06 21:22:28,570 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-11-06 21:22:28,570 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-06 21:22:28,570 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-06 21:22:28,570 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-06 21:22:28,570 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-11-06 21:22:28,571 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: (and (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= ~__return_305~0 |old(~__return_305~0)|) (= ~__tmp_247_0~0 |old(~__tmp_247_0~0)|)) [2019-11-06 21:22:28,571 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-06 21:22:28,572 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-06 21:22:28,572 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-06 21:22:28,572 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-06 21:22:28,573 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-11-06 21:22:28,573 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-06 21:22:28,573 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-06 21:22:28,574 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-06 21:22:28,574 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-06 21:22:28,574 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-06 21:22:28,574 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-06 21:22:28,574 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-06 21:22:28,575 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-06 21:22:28,576 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-06 21:22:28,576 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-06 21:22:28,576 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-06 21:22:28,576 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-06 21:22:28,576 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-06 21:22:28,576 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-06 21:22:28,577 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-11-06 21:22:28,578 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-06 21:22:28,578 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-11-06 21:22:28,578 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-06 21:22:28,578 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-06 21:22:28,578 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-06 21:22:28,578 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-06 21:22:28,578 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-06 21:22:28,579 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-06 21:22:28,579 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-06 21:22:28,579 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-06 21:22:28,579 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-06 21:22:28,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:22:28 BoogieIcfgContainer [2019-11-06 21:22:28,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:22:28,607 INFO L168 Benchmark]: Toolchain (without parser) took 6729.39 ms. Allocated memory was 148.4 MB in the beginning and 270.5 MB in the end (delta: 122.2 MB). Free memory was 106.6 MB in the beginning and 120.6 MB in the end (delta: -13.9 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,609 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 148.4 MB. Free memory was 124.6 MB in the beginning and 124.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.02 ms. Allocated memory was 148.4 MB in the beginning and 205.5 MB in the end (delta: 57.1 MB). Free memory was 106.2 MB in the beginning and 184.3 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,615 INFO L168 Benchmark]: Boogie Preprocessor took 54.80 ms. Allocated memory is still 205.5 MB. Free memory was 184.3 MB in the beginning and 182.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,617 INFO L168 Benchmark]: RCFGBuilder took 450.85 ms. Allocated memory is still 205.5 MB. Free memory was 182.4 MB in the beginning and 158.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,622 INFO L168 Benchmark]: TraceAbstraction took 5691.32 ms. Allocated memory was 205.5 MB in the beginning and 270.5 MB in the end (delta: 65.0 MB). Free memory was 158.1 MB in the beginning and 120.6 MB in the end (delta: 37.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,629 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.45 ms. Allocated memory is still 148.4 MB. Free memory was 124.6 MB in the beginning and 124.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 527.02 ms. Allocated memory was 148.4 MB in the beginning and 205.5 MB in the end (delta: 57.1 MB). Free memory was 106.2 MB in the beginning and 184.3 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.80 ms. Allocated memory is still 205.5 MB. Free memory was 184.3 MB in the beginning and 182.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.85 ms. Allocated memory is still 205.5 MB. Free memory was 182.4 MB in the beginning and 158.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5691.32 ms. Allocated memory was 205.5 MB in the beginning and 270.5 MB in the end (delta: 65.0 MB). Free memory was 158.1 MB in the beginning and 120.6 MB in the end (delta: 37.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 799 SDtfs, 1424 SDslu, 764 SDs, 0 SdLazy, 2189 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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, 18 MinimizatonAttempts, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 90 HoareAnnotationTreeSize, 9 FomulaSimplifications, 138182 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3253 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 14424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...