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-f4eb214f-m [2019-10-13 19:16:17,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:16:17,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:16:17,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:16:17,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:16:17,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:16:17,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:16:17,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:16:17,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:16:17,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:16:17,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:16:17,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:16:17,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:16:17,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:16:17,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:16:17,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:16:17,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:16:17,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:16:17,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:16:17,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:16:17,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:16:17,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:16:17,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:16:17,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:16:17,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:16:17,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:16:17,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:16:17,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:16:17,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:16:17,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:16:17,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:16:17,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:16:17,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:16:17,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:16:17,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:16:17,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:16:17,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:16:17,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:16:17,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:16:17,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:16:17,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:16:17,731 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-10-13 19:16:17,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:16:17,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:16:17,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:16:17,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:16:17,752 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:16:17,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:16:17,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:16:17,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:16:17,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:16:17,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:16:17,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:16:17,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:16:17,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:16:17,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:16:17,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:16:17,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:16:17,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:16:17,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:16:17,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:16:17,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:16:17,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:16:17,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:16:17,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:16:17,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:16:17,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:16:17,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:16:17,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:16:17,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:16:17,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:16:18,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:16:18,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:16:18,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:16:18,064 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:16:18,064 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:16:18,065 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-10-13 19:16:18,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe2d9a3b/0f855034a6e6446a9bc88334d714504b/FLAG8820de712 [2019-10-13 19:16:18,580 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:16:18,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-13 19:16:18,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe2d9a3b/0f855034a6e6446a9bc88334d714504b/FLAG8820de712 [2019-10-13 19:16:18,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe2d9a3b/0f855034a6e6446a9bc88334d714504b [2019-10-13 19:16:18,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:16:18,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:16:18,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:18,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:16:18,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:16:18,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:16:18" (1/1) ... [2019-10-13 19:16:18,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4822bd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:18, skipping insertion in model container [2019-10-13 19:16:18,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:16:18" (1/1) ... [2019-10-13 19:16:19,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:16:19,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:16:19,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:19,330 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:16:19,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:19,482 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:16:19,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19 WrapperNode [2019-10-13 19:16:19,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:19,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:16:19,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:16:19,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:16:19,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (1/1) ... [2019-10-13 19:16:19,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:16:19,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:16:19,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:16:19,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:16:19,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (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-10-13 19:16:19,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:16:19,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:16:19,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:16:19,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:16:19,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:16:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:16:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:16:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:16:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:16:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:16:19,995 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:16:19,995 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:16:19,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:16:19 BoogieIcfgContainer [2019-10-13 19:16:19,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:16:19,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:16:19,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:16:20,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:16:20,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:16:18" (1/3) ... [2019-10-13 19:16:20,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266d28be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:20, skipping insertion in model container [2019-10-13 19:16:20,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:19" (2/3) ... [2019-10-13 19:16:20,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266d28be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:20, skipping insertion in model container [2019-10-13 19:16:20,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:16:19" (3/3) ... [2019-10-13 19:16:20,005 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-10-13 19:16:20,015 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:16:20,023 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-13 19:16:20,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-13 19:16:20,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:16:20,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:16:20,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:16:20,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:16:20,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:16:20,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:16:20,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:16:20,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:16:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-13 19:16:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 19:16:20,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:20,095 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:20,097 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:20,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-10-13 19:16:20,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:20,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073459123] [2019-10-13 19:16:20,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:20,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073459123] [2019-10-13 19:16:20,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:20,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:20,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016657571] [2019-10-13 19:16:20,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:20,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:20,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:20,351 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2019-10-13 19:16:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:20,770 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2019-10-13 19:16:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:20,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-13 19:16:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:20,784 INFO L225 Difference]: With dead ends: 137 [2019-10-13 19:16:20,785 INFO L226 Difference]: Without dead ends: 113 [2019-10-13 19:16:20,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-13 19:16:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-10-13 19:16:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 19:16:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-13 19:16:20,841 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-10-13 19:16:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:20,842 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-13 19:16:20,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-13 19:16:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 19:16:20,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:20,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:20,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-10-13 19:16:20,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:20,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781145300] [2019-10-13 19:16:20,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:20,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781145300] [2019-10-13 19:16:20,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:20,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:20,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783745170] [2019-10-13 19:16:20,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:20,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:20,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:20,940 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-13 19:16:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,138 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-13 19:16:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:21,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-13 19:16:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,142 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:21,142 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:21,145 INFO L600 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-10-13 19:16:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-13 19:16:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 19:16:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-13 19:16:21,162 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-10-13 19:16:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,162 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-13 19:16:21,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-13 19:16:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 19:16:21,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:21,165 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-10-13 19:16:21,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373256633] [2019-10-13 19:16:21,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:21,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373256633] [2019-10-13 19:16:21,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:21,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713957002] [2019-10-13 19:16:21,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:21,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:21,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:21,292 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-13 19:16:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,482 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-13 19:16:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:21,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 19:16:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,484 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:16:21,484 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 19:16:21,484 INFO L600 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-10-13 19:16:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 19:16:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-13 19:16:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:16:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-10-13 19:16:21,494 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-10-13 19:16:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,494 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-10-13 19:16:21,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-10-13 19:16:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:16:21,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,496 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:21,496 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-10-13 19:16:21,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288170371] [2019-10-13 19:16:21,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:21,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288170371] [2019-10-13 19:16:21,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:21,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072151380] [2019-10-13 19:16:21,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:21,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:21,600 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2019-10-13 19:16:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,782 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-13 19:16:21,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:21,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 19:16:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,783 INFO L225 Difference]: With dead ends: 71 [2019-10-13 19:16:21,784 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 19:16:21,784 INFO L600 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-10-13 19:16:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 19:16:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-13 19:16:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 19:16:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 19:16:21,792 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-10-13 19:16:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,792 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 19:16:21,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 19:16:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:16:21,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:21,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-10-13 19:16:21,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224372209] [2019-10-13 19:16:21,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:21,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224372209] [2019-10-13 19:16:21,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:21,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743917274] [2019-10-13 19:16:21,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:21,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:21,860 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2019-10-13 19:16:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,063 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-13 19:16:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:22,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 19:16:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,065 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:22,066 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:22,066 INFO L600 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-10-13 19:16:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-13 19:16:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 19:16:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-13 19:16:22,074 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-10-13 19:16:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,074 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-13 19:16:22,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-13 19:16:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:22,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,077 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:22,078 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-10-13 19:16:22,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654661868] [2019-10-13 19:16:22,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:22,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654661868] [2019-10-13 19:16:22,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:22,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335831522] [2019-10-13 19:16:22,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:22,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:22,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:22,185 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-10-13 19:16:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,445 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-10-13 19:16:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:22,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-13 19:16:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,447 INFO L225 Difference]: With dead ends: 112 [2019-10-13 19:16:22,447 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 19:16:22,448 INFO L600 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-10-13 19:16:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 19:16:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-10-13 19:16:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 19:16:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-13 19:16:22,456 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-10-13 19:16:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,456 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-13 19:16:22,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-13 19:16:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:22,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,458 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:22,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-10-13 19:16:22,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301702094] [2019-10-13 19:16:22,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:22,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301702094] [2019-10-13 19:16:22,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:22,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3854114] [2019-10-13 19:16:22,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:22,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:22,520 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-13 19:16:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,645 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-13 19:16:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:22,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 19:16:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,646 INFO L225 Difference]: With dead ends: 65 [2019-10-13 19:16:22,647 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 19:16:22,648 INFO L600 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-10-13 19:16:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 19:16:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-13 19:16:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 19:16:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-10-13 19:16:22,655 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-10-13 19:16:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,655 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-10-13 19:16:22,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-10-13 19:16:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:22,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:22,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-10-13 19:16:22,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597735568] [2019-10-13 19:16:22,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:22,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597735568] [2019-10-13 19:16:22,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:22,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135851688] [2019-10-13 19:16:22,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:22,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:22,715 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-10-13 19:16:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,828 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-13 19:16:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:22,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 19:16:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,829 INFO L225 Difference]: With dead ends: 61 [2019-10-13 19:16:22,829 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 19:16:22,830 INFO L600 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-10-13 19:16:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 19:16:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-10-13 19:16:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 19:16:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-13 19:16:22,836 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-10-13 19:16:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,836 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-13 19:16:22,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-13 19:16:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:22,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:22,838 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-10-13 19:16:22,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98377087] [2019-10-13 19:16:22,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:22,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98377087] [2019-10-13 19:16:22,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:22,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890224576] [2019-10-13 19:16:22,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:22,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:22,919 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2019-10-13 19:16:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,167 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-10-13 19:16:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:23,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,168 INFO L225 Difference]: With dead ends: 95 [2019-10-13 19:16:23,169 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 19:16:23,169 INFO L600 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-10-13 19:16:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 19:16:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-10-13 19:16:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:16:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 19:16:23,177 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-10-13 19:16:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,177 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 19:16:23,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 19:16:23,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:23,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,179 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:23,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-10-13 19:16:23,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212909523] [2019-10-13 19:16:23,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:23,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212909523] [2019-10-13 19:16:23,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435653285] [2019-10-13 19:16:23,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,225 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2019-10-13 19:16:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,409 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-10-13 19:16:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:23,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,416 INFO L225 Difference]: With dead ends: 72 [2019-10-13 19:16:23,416 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 19:16:23,417 INFO L600 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-10-13 19:16:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 19:16:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-10-13 19:16:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 19:16:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-13 19:16:23,421 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-10-13 19:16:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,422 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-13 19:16:23,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-13 19:16:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:23,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:23,424 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-10-13 19:16:23,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874693961] [2019-10-13 19:16:23,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:23,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874693961] [2019-10-13 19:16:23,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597619657] [2019-10-13 19:16:23,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,477 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2019-10-13 19:16:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,613 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-10-13 19:16:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:23,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,615 INFO L225 Difference]: With dead ends: 53 [2019-10-13 19:16:23,615 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 19:16:23,616 INFO L600 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-10-13 19:16:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 19:16:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-13 19:16:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 19:16:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-13 19:16:23,627 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-10-13 19:16:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,627 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-13 19:16:23,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-13 19:16:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:23,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:23,631 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-10-13 19:16:23,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686709500] [2019-10-13 19:16:23,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:23,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686709500] [2019-10-13 19:16:23,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853334387] [2019-10-13 19:16:23,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,732 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-10-13 19:16:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,883 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-10-13 19:16:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:23,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,889 INFO L225 Difference]: With dead ends: 50 [2019-10-13 19:16:23,889 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 19:16:23,890 INFO L600 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-10-13 19:16:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 19:16:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-10-13 19:16:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 19:16:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-13 19:16:23,894 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-10-13 19:16:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,894 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-13 19:16:23,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-13 19:16:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:23,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:23,896 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-10-13 19:16:23,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67755936] [2019-10-13 19:16:23,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:23,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67755936] [2019-10-13 19:16:23,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489391403] [2019-10-13 19:16:23,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,951 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-10-13 19:16:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,145 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-13 19:16:24,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:24,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,146 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:24,146 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:24,147 INFO L600 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-10-13 19:16:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-10-13 19:16:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 19:16:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-13 19:16:24,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-10-13 19:16:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,151 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-13 19:16:24,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-13 19:16:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:24,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:24,153 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-10-13 19:16:24,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607282961] [2019-10-13 19:16:24,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:24,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607282961] [2019-10-13 19:16:24,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602059357] [2019-10-13 19:16:24,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,235 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-10-13 19:16:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,395 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-10-13 19:16:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:24,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,397 INFO L225 Difference]: With dead ends: 57 [2019-10-13 19:16:24,397 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 19:16:24,397 INFO L600 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-10-13 19:16:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 19:16:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-10-13 19:16:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 19:16:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-13 19:16:24,401 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-10-13 19:16:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,401 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-13 19:16:24,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-13 19:16:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:24,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:24,403 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-10-13 19:16:24,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012050050] [2019-10-13 19:16:24,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:24,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012050050] [2019-10-13 19:16:24,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751152216] [2019-10-13 19:16:24,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,485 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-10-13 19:16:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,622 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-13 19:16:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:24,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,624 INFO L225 Difference]: With dead ends: 41 [2019-10-13 19:16:24,624 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 19:16:24,625 INFO L600 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-10-13 19:16:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 19:16:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 19:16:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 19:16:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-13 19:16:24,629 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-10-13 19:16:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,630 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-13 19:16:24,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-13 19:16:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:16:24,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:24,631 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-10-13 19:16:24,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128221522] [2019-10-13 19:16:24,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:24,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128221522] [2019-10-13 19:16:24,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647500349] [2019-10-13 19:16:24,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,696 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-10-13 19:16:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,852 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-13 19:16:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:24,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 19:16:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,854 INFO L225 Difference]: With dead ends: 52 [2019-10-13 19:16:24,854 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 19:16:24,855 INFO L600 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-10-13 19:16:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 19:16:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-10-13 19:16:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 19:16:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-13 19:16:24,859 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-10-13 19:16:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,860 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-13 19:16:24,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-13 19:16:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:16:24,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,861 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:24,861 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-10-13 19:16:24,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329128479] [2019-10-13 19:16:24,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:24,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329128479] [2019-10-13 19:16:24,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:16:24,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554744997] [2019-10-13 19:16:24,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:16:24,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:16:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:24,929 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-10-13 19:16:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:25,085 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-13 19:16:25,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:25,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 19:16:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:25,089 INFO L225 Difference]: With dead ends: 56 [2019-10-13 19:16:25,089 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 19:16:25,089 INFO L600 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-10-13 19:16:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 19:16:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-10-13 19:16:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 19:16:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 19:16:25,095 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-10-13 19:16:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:25,095 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 19:16:25,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:16:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 19:16:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:16:25,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:25,096 INFO L380 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-10-13 19:16:25,097 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-10-13 19:16:25,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:25,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183642630] [2019-10-13 19:16:25,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:25,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:25,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:25,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183642630] [2019-10-13 19:16:25,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:25,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:25,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595065094] [2019-10-13 19:16:25,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:25,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:25,142 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-13 19:16:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:25,228 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-13 19:16:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:25,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 19:16:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:25,229 INFO L225 Difference]: With dead ends: 37 [2019-10-13 19:16:25,229 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:16:25,230 INFO L600 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-10-13 19:16:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:16:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:16:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:16:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:16:25,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-13 19:16:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:25,231 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:16:25,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:16:25,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:16:25,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:16:25,705 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 14 [2019-10-13 19:16:25,818 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,819 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-10-13 19:16:25,819 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,819 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,819 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:16:25,819 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:16:25,819 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,819 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-13 19:16:25,820 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-10-13 19:16:25,821 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-10-13 19:16:25,822 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-10-13 19:16:25,823 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-10-13 19:16:25,823 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-10-13 19:16:25,823 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-10-13 19:16:25,823 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-10-13 19:16:25,823 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-10-13 19:16:25,823 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-10-13 19:16:25,823 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-10-13 19:16:25,824 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-10-13 19:16:25,824 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-10-13 19:16:25,824 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-13 19:16:25,824 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-10-13 19:16:25,824 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-13 19:16:25,824 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-13 19:16:25,824 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-10-13 19:16:25,825 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-10-13 19:16:25,826 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-10-13 19:16:25,827 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-10-13 19:16:25,827 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-10-13 19:16:25,828 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-10-13 19:16:25,828 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-10-13 19:16:25,828 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-13 19:16:25,828 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-13 19:16:25,828 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-10-13 19:16:25,828 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-10-13 19:16:25,829 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-10-13 19:16:25,829 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-10-13 19:16:25,829 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-13 19:16:25,829 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-10-13 19:16:25,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:16:25 BoogieIcfgContainer [2019-10-13 19:16:25,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:16:25,847 INFO L168 Benchmark]: Toolchain (without parser) took 6864.46 ms. Allocated memory was 144.2 MB in the beginning and 283.1 MB in the end (delta: 138.9 MB). Free memory was 102.3 MB in the beginning and 197.2 MB in the end (delta: -95.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,848 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.24 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 180.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,850 INFO L168 Benchmark]: Boogie Preprocessor took 42.08 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 178.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,850 INFO L168 Benchmark]: RCFGBuilder took 471.17 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 154.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,851 INFO L168 Benchmark]: TraceAbstraction took 5847.44 ms. Allocated memory was 201.9 MB in the beginning and 283.1 MB in the end (delta: 81.3 MB). Free memory was 154.0 MB in the beginning and 197.2 MB in the end (delta: -43.2 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,855 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.24 ms. Allocated memory is still 144.2 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 499.24 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 180.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.08 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 178.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.17 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 154.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5847.44 ms. Allocated memory was 201.9 MB in the beginning and 283.1 MB in the end (delta: 81.3 MB). Free memory was 154.0 MB in the beginning and 197.2 MB in the end (delta: -43.2 MB). Peak memory consumption was 140.7 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: 172]: 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: 305]: 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: 232]: 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: 220]: 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: 110]: 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 - PositiveResult [Line: 138]: 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: 80]: 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: 39]: 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.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, 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.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3253 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s 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...