java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:16:17,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:16:17,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:16:17,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:16:17,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:16:17,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:16:17,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:16:17,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:16:17,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:16:17,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:16:17,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:16:17,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:16:17,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:16:17,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:16:17,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:16:17,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:16:17,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:16:17,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:16:17,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:16:17,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:16:17,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:16:17,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:16:17,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:16:17,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:16:17,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:16:17,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:16:17,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:16:17,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:16:17,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:16:17,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:16:17,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:16:17,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:16:17,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:16:17,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:16:17,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:16:17,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:16:17,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:16:17,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:16:17,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:16:17,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:16:17,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:16:17,637 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,654 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:16:17,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:16:17,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:16:17,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:16:17,658 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:16:17,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:16:17,658 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:16:17,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:16:17,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:16:17,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:16:17,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:16:17,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:16:17,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:16:17,661 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:16:17,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:16:17,661 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:16:17,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:16:17,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:16:17,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:16:17,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:16:17,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:16:17,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:16:17,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:16:17,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:16:17,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:16:17,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:16:17,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:16:17,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:16:17,664 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:16:17,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:16:17,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:16:17,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:16:17,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:16:17,966 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:16:17,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-13 19:16:18,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbbaf8f2/39e85bfd3b544764bc904a43cdcef783/FLAG61f1adaef [2019-10-13 19:16:18,522 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:16:18,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-13 19:16:18,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbbaf8f2/39e85bfd3b544764bc904a43cdcef783/FLAG61f1adaef [2019-10-13 19:16:18,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbbaf8f2/39e85bfd3b544764bc904a43cdcef783 [2019-10-13 19:16:18,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:16:18,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:16:18,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:18,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:16:18,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:16:18,911 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,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da11249 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,914 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:18,922 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:16:18,977 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:16:19,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:19,189 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:16:19,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:19,338 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:16:19,339 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,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:19,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:16:19,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:16:19,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:16:19,352 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,352 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,361 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,361 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,369 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,374 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,376 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,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:16:19,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:16:19,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:16:19,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:16:19,381 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,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:16:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:16:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:16:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:16:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:16:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:16:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:16:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:16:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:16:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:16:19,874 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:16:19,875 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:16:19,876 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,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:16:19,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:16:19,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:16:19,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:16:19,881 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:19,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e4be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:19, skipping insertion in model container [2019-10-13 19:16:19,882 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:19,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0e4be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:19, skipping insertion in model container [2019-10-13 19:16:19,882 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:19,884 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-10-13 19:16:19,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:16:19,904 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-13 19:16:19,915 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-13 19:16:19,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:16:19,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:16:19,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:16:19,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:16:19,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:16:19,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:16:19,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:16:19,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:16:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-13 19:16:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 19:16:19,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:19,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:19,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:19,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-10-13 19:16:19,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:19,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268361716] [2019-10-13 19:16:19,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,212 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,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268361716] [2019-10-13 19:16:20,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:20,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:20,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589699256] [2019-10-13 19:16:20,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:20,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:20,239 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2019-10-13 19:16:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:20,748 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2019-10-13 19:16:20,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:20,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-13 19:16:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:20,767 INFO L225 Difference]: With dead ends: 135 [2019-10-13 19:16:20,768 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 19:16:20,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 19:16:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-10-13 19:16:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 19:16:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-13 19:16:20,843 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-10-13 19:16:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:20,844 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-13 19:16:20,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-13 19:16:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 19:16:20,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:20,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:20,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-10-13 19:16:20,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:20,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157970861] [2019-10-13 19:16:20,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,946 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,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157970861] [2019-10-13 19:16:20,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:20,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:20,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552946570] [2019-10-13 19:16:20,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:20,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:20,950 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2019-10-13 19:16:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,159 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-10-13 19:16:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:21,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-13 19:16:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,161 INFO L225 Difference]: With dead ends: 111 [2019-10-13 19:16:21,161 INFO L226 Difference]: Without dead ends: 109 [2019-10-13 19:16:21,163 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:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-13 19:16:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-10-13 19:16:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-13 19:16:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-13 19:16:21,173 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-10-13 19:16:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,173 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-13 19:16:21,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-13 19:16:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:16:21,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,175 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,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-10-13 19:16:21,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315067058] [2019-10-13 19:16:21,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,276 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,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315067058] [2019-10-13 19:16:21,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:21,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665824516] [2019-10-13 19:16:21,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:21,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:21,279 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2019-10-13 19:16:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,515 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-13 19:16:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:21,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 19:16:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,518 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:16:21,518 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 19:16:21,519 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,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 19:16:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-10-13 19:16:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 19:16:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-13 19:16:21,532 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-10-13 19:16:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,532 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-13 19:16:21,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-13 19:16:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:16:21,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,536 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,538 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-10-13 19:16:21,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956352334] [2019-10-13 19:16:21,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,655 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,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956352334] [2019-10-13 19:16:21,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:21,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802002674] [2019-10-13 19:16:21,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:21,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:21,662 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-10-13 19:16:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,857 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-13 19:16:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:21,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 19:16:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,858 INFO L225 Difference]: With dead ends: 71 [2019-10-13 19:16:21,859 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 19:16:21,859 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,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 19:16:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-13 19:16:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 19:16:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-13 19:16:21,867 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-10-13 19:16:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,867 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-13 19:16:21,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-13 19:16:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:21,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,868 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:21,869 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-10-13 19:16:21,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648362244] [2019-10-13 19:16:21,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,951 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,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648362244] [2019-10-13 19:16:21,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:21,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518892570] [2019-10-13 19:16:21,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:21,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:21,957 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2019-10-13 19:16:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,246 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-10-13 19:16:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:22,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-13 19:16:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,249 INFO L225 Difference]: With dead ends: 116 [2019-10-13 19:16:22,249 INFO L226 Difference]: Without dead ends: 114 [2019-10-13 19:16:22,252 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,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-13 19:16:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-10-13 19:16:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 19:16:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-13 19:16:22,262 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-10-13 19:16:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,262 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-13 19:16:22,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-13 19:16:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:22,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,263 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,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-10-13 19:16:22,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967623425] [2019-10-13 19:16:22,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,333 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,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967623425] [2019-10-13 19:16:22,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:22,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713374904] [2019-10-13 19:16:22,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:22,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:22,335 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-10-13 19:16:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,546 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-10-13 19:16:22,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:22,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-13 19:16:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,548 INFO L225 Difference]: With dead ends: 101 [2019-10-13 19:16:22,548 INFO L226 Difference]: Without dead ends: 99 [2019-10-13 19:16:22,549 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,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-13 19:16:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-10-13 19:16:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 19:16:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-13 19:16:22,557 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-10-13 19:16:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,557 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-13 19:16:22,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-13 19:16:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:22,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,558 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,559 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-10-13 19:16:22,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129929315] [2019-10-13 19:16:22,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,606 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,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129929315] [2019-10-13 19:16:22,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:22,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082719819] [2019-10-13 19:16:22,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:22,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:22,609 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-10-13 19:16:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,738 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-13 19:16:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:22,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 19:16:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,740 INFO L225 Difference]: With dead ends: 65 [2019-10-13 19:16:22,741 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 19:16:22,742 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,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 19:16:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-13 19:16:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 19:16:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-13 19:16:22,748 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-10-13 19:16:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,749 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-13 19:16:22,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-13 19:16:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:22,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,750 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,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-10-13 19:16:22,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255077539] [2019-10-13 19:16:22,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:22,831 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,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255077539] [2019-10-13 19:16:22,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:22,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:22,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435395557] [2019-10-13 19:16:22,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:22,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:22,834 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-10-13 19:16:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:22,959 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-13 19:16:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:22,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 19:16:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:22,961 INFO L225 Difference]: With dead ends: 61 [2019-10-13 19:16:22,961 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 19:16:22,962 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,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 19:16:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-13 19:16:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 19:16:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-13 19:16:22,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-10-13 19:16:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:22,968 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-13 19:16:22,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-13 19:16:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:22,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:22,969 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,970 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-10-13 19:16:22,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:22,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126338712] [2019-10-13 19:16:22,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:22,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,033 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,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126338712] [2019-10-13 19:16:23,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232831739] [2019-10-13 19:16:23,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,035 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2019-10-13 19:16:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,282 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-10-13 19:16:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:23,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,283 INFO L225 Difference]: With dead ends: 94 [2019-10-13 19:16:23,284 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 19:16:23,284 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,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 19:16:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-10-13 19:16:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 19:16:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-13 19:16:23,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-10-13 19:16:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,290 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-13 19:16:23,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-13 19:16:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:23,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,291 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,291 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-10-13 19:16:23,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051381861] [2019-10-13 19:16:23,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:23,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051381861] [2019-10-13 19:16:23,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534975391] [2019-10-13 19:16:23,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,357 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2019-10-13 19:16:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,589 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-10-13 19:16:23,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:23,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,590 INFO L225 Difference]: With dead ends: 84 [2019-10-13 19:16:23,590 INFO L226 Difference]: Without dead ends: 82 [2019-10-13 19:16:23,591 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,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-13 19:16:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-10-13 19:16:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-13 19:16:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-13 19:16:23,596 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-10-13 19:16:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,596 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-13 19:16:23,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-13 19:16:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:23,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,598 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,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-10-13 19:16:23,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622156986] [2019-10-13 19:16:23,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,643 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,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622156986] [2019-10-13 19:16:23,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141511684] [2019-10-13 19:16:23,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,645 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2019-10-13 19:16:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:23,822 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-10-13 19:16:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:23,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:23,823 INFO L225 Difference]: With dead ends: 70 [2019-10-13 19:16:23,823 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 19:16:23,824 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,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 19:16:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-10-13 19:16:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 19:16:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-13 19:16:23,830 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-10-13 19:16:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:23,830 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-13 19:16:23,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-13 19:16:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:23,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:23,831 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,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-10-13 19:16:23,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:23,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503573531] [2019-10-13 19:16:23,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:23,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:23,872 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,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503573531] [2019-10-13 19:16:23,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:23,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:23,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464413939] [2019-10-13 19:16:23,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:23,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:23,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:23,874 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2019-10-13 19:16:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,007 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-10-13 19:16:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:24,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,008 INFO L225 Difference]: With dead ends: 51 [2019-10-13 19:16:24,009 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 19:16:24,009 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,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 19:16:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-13 19:16:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-13 19:16:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-13 19:16:24,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-10-13 19:16:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,016 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-13 19:16:24,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-13 19:16:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:24,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,017 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,017 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-10-13 19:16:24,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269956863] [2019-10-13 19:16:24,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,061 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,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269956863] [2019-10-13 19:16:24,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347636370] [2019-10-13 19:16:24,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,063 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-10-13 19:16:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,231 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-13 19:16:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:24,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,232 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:24,232 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:24,233 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,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-10-13 19:16:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 19:16:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-13 19:16:24,237 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-10-13 19:16:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,237 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-13 19:16:24,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-13 19:16:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:24,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,238 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,239 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-10-13 19:16:24,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728949130] [2019-10-13 19:16:24,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,305 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,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728949130] [2019-10-13 19:16:24,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82488453] [2019-10-13 19:16:24,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,307 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-10-13 19:16:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,472 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-13 19:16:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:24,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,474 INFO L225 Difference]: With dead ends: 59 [2019-10-13 19:16:24,474 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 19:16:24,475 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,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 19:16:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-10-13 19:16:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 19:16:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-13 19:16:24,479 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-10-13 19:16:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,480 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-13 19:16:24,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-13 19:16:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:24,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,481 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,481 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-10-13 19:16:24,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413664038] [2019-10-13 19:16:24,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,555 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,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413664038] [2019-10-13 19:16:24,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896567705] [2019-10-13 19:16:24,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,557 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-10-13 19:16:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,670 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-13 19:16:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:24,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,671 INFO L225 Difference]: With dead ends: 43 [2019-10-13 19:16:24,672 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 19:16:24,672 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,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 19:16:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-13 19:16:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 19:16:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-13 19:16:24,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-10-13 19:16:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,676 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-13 19:16:24,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-13 19:16:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:16:24,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,678 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,678 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-10-13 19:16:24,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465014286] [2019-10-13 19:16:24,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,735 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,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465014286] [2019-10-13 19:16:24,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:24,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603366861] [2019-10-13 19:16:24,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:24,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:24,738 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-10-13 19:16:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:24,889 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-10-13 19:16:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:24,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 19:16:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:24,890 INFO L225 Difference]: With dead ends: 54 [2019-10-13 19:16:24,890 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 19:16:24,891 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,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 19:16:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-10-13 19:16:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 19:16:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-13 19:16:24,895 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-10-13 19:16:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:24,895 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-13 19:16:24,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-13 19:16:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:16:24,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:24,896 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,897 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-10-13 19:16:24,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:24,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730123184] [2019-10-13 19:16:24,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:24,957 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,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730123184] [2019-10-13 19:16:24,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:24,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:16:24,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541006564] [2019-10-13 19:16:24,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:16:24,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:24,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:16:24,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:24,961 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2019-10-13 19:16:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:25,135 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-13 19:16:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:25,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 19:16:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:25,138 INFO L225 Difference]: With dead ends: 56 [2019-10-13 19:16:25,139 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 19:16:25,139 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,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 19:16:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2019-10-13 19:16:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 19:16:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-13 19:16:25,145 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-10-13 19:16:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:25,145 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-13 19:16:25,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:16:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-13 19:16:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:16:25,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:25,146 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,147 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-10-13 19:16:25,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:25,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022895896] [2019-10-13 19:16:25,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:25,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:25,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:25,185 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,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022895896] [2019-10-13 19:16:25,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:25,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:25,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719331633] [2019-10-13 19:16:25,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:25,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:25,188 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-10-13 19:16:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:25,280 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-13 19:16:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:25,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 19:16:25,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:25,281 INFO L225 Difference]: With dead ends: 37 [2019-10-13 19:16:25,281 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:16:25,282 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,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:16:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:16:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:16:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:16:25,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-13 19:16:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:25,283 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:16:25,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:16:25,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:16:25,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:16:25,614 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,615 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)|) (= ~__tmp_259_0~0 |old(~__tmp_259_0~0)|) (= ~__return_305~0 |old(~__return_305~0)|)) [2019-10-13 19:16:25,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,615 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:16:25,615 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:16:25,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-10-13 19:16:25,616 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-10-13 19:16:25,617 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-10-13 19:16:25,617 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-10-13 19:16:25,618 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-13 19:16:25,618 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-10-13 19:16:25,619 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-10-13 19:16:25,619 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-10-13 19:16:25,619 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-10-13 19:16:25,619 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-10-13 19:16:25,619 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-10-13 19:16:25,620 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-13 19:16:25,620 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-10-13 19:16:25,620 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-10-13 19:16:25,621 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-10-13 19:16:25,621 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 19:16:25,621 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-10-13 19:16:25,621 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-10-13 19:16:25,622 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-13 19:16:25,622 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-10-13 19:16:25,622 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-10-13 19:16:25,622 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: (and (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= ~__tmp_259_0~0 |old(~__tmp_259_0~0)|) (= ~__return_305~0 |old(~__return_305~0)|)) [2019-10-13 19:16:25,622 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 19:16:25,622 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-10-13 19:16:25,622 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-10-13 19:16:25,623 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-10-13 19:16:25,624 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-10-13 19:16:25,624 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-10-13 19:16:25,624 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-10-13 19:16:25,624 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-10-13 19:16:25,624 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-10-13 19:16:25,624 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__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,624 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-10-13 19:16:25,625 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-13 19:16:25,626 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-10-13 19:16:25,626 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-13 19:16:25,626 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-13 19:16:25,626 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-10-13 19:16:25,626 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-10-13 19:16:25,626 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-10-13 19:16:25,626 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-10-13 19:16:25,627 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 19:16:25,649 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,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:16:25,653 INFO L168 Benchmark]: Toolchain (without parser) took 6747.10 ms. Allocated memory was 137.4 MB in the beginning and 289.4 MB in the end (delta: 152.0 MB). Free memory was 101.1 MB in the beginning and 189.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,653 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.73 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 178.3 MB in the end (delta: -77.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,655 INFO L168 Benchmark]: Boogie Preprocessor took 40.05 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 176.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,656 INFO L168 Benchmark]: RCFGBuilder took 496.27 ms. Allocated memory is still 201.3 MB. Free memory was 176.9 MB in the beginning and 151.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,657 INFO L168 Benchmark]: TraceAbstraction took 5772.42 ms. Allocated memory was 201.3 MB in the beginning and 289.4 MB in the end (delta: 88.1 MB). Free memory was 151.6 MB in the beginning and 189.9 MB in the end (delta: -38.2 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:25,663 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.44 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 433.73 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.9 MB in the beginning and 178.3 MB in the end (delta: -77.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.05 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 176.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 496.27 ms. Allocated memory is still 201.3 MB. Free memory was 176.9 MB in the beginning and 151.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5772.42 ms. Allocated memory was 201.3 MB in the beginning and 289.4 MB in the end (delta: 88.1 MB). Free memory was 151.6 MB in the beginning and 189.9 MB in the end (delta: -38.2 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 849 SDtfs, 1566 SDslu, 852 SDs, 0 SdLazy, 2344 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 71 HoareAnnotationTreeSize, 9 FomulaSimplifications, 849927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2631 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 14546 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...