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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:17:51,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:17:51,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:17:51,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:17:51,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:17:51,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:17:51,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:17:51,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:17:51,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:17:51,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:17:51,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:17:51,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:17:51,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:17:51,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:17:51,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:17:51,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:17:51,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:17:51,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:17:51,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:17:51,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:17:51,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:17:51,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:17:51,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:17:51,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:17:51,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:17:51,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:17:51,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:17:51,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:17:51,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:17:51,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:17:51,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:17:51,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:17:51,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:17:51,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:17:51,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:17:51,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:17:51,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:17:51,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:17:51,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:17:51,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:17:51,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:17:51,172 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-02 11:17:51,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:17:51,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:17:51,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:17:51,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:17:51,188 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:17:51,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:17:51,189 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:17:51,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:17:51,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:17:51,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:17:51,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:17:51,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:17:51,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:17:51,190 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:17:51,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:17:51,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:17:51,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:17:51,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:17:51,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:17:51,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:17:51,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:17:51,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:17:51,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:17:51,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:17:51,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:17:51,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:17:51,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:17:51,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:17:51,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:17:51,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:17:51,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:17:51,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:17:51,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:17:51,241 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:17:51,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-02 11:17:51,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98b7bbe7/eb7820919cf4467ab8d4e12c3c5ebf1d/FLAG30123936d [2019-10-02 11:17:51,788 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:17:51,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-02 11:17:51,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98b7bbe7/eb7820919cf4467ab8d4e12c3c5ebf1d/FLAG30123936d [2019-10-02 11:17:52,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98b7bbe7/eb7820919cf4467ab8d4e12c3c5ebf1d [2019-10-02 11:17:52,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:17:52,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:17:52,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:52,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:17:52,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:17:52,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65342265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52, skipping insertion in model container [2019-10-02 11:17:52,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,166 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:17:52,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:17:52,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:52,492 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:17:52,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:52,651 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:17:52,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52 WrapperNode [2019-10-02 11:17:52,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:52,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:17:52,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:17:52,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:17:52,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (1/1) ... [2019-10-02 11:17:52,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:17:52,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:17:52,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:17:52,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:17:52,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (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-02 11:17:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:17:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:17:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:17:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:17:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:17:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:17:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:17:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:17:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:17:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:17:53,129 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:17:53,129 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:17:53,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:53 BoogieIcfgContainer [2019-10-02 11:17:53,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:17:53,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:17:53,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:17:53,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:17:53,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:17:52" (1/3) ... [2019-10-02 11:17:53,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f5de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:53, skipping insertion in model container [2019-10-02 11:17:53,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:52" (2/3) ... [2019-10-02 11:17:53,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f5de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:53, skipping insertion in model container [2019-10-02 11:17:53,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:53" (3/3) ... [2019-10-02 11:17:53,139 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-02 11:17:53,149 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:17:53,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-02 11:17:53,187 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-02 11:17:53,216 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:17:53,217 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:17:53,217 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:17:53,217 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:17:53,217 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:17:53,217 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:17:53,217 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:17:53,218 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:17:53,218 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:17:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-10-02 11:17:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:17:53,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:53,245 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-10-02 11:17:53,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,426 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-02 11:17:53,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:17:53,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:17:53,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:17:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:17:53,446 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-10-02 11:17:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,488 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2019-10-02 11:17:53,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:17:53,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 11:17:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,500 INFO L225 Difference]: With dead ends: 88 [2019-10-02 11:17:53,500 INFO L226 Difference]: Without dead ends: 76 [2019-10-02 11:17:53,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:17:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-02 11:17:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-10-02 11:17:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 11:17:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-02 11:17:53,552 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-10-02 11:17:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:53,553 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-02 11:17:53,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:17:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-02 11:17:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:17:53,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:53,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-10-02 11:17:53,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,632 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-02 11:17:53,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:53,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:53,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:53,635 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-02 11:17:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,754 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2019-10-02 11:17:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:53,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-02 11:17:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,757 INFO L225 Difference]: With dead ends: 153 [2019-10-02 11:17:53,757 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 11:17:53,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 11:17:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-10-02 11:17:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 11:17:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-02 11:17:53,777 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-10-02 11:17:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:53,778 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-02 11:17:53,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-02 11:17:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:17:53,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:53,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:53,780 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-10-02 11:17:53,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:53,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:53,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:53,852 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-02 11:17:53,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:53,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:53,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:53,854 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-10-02 11:17:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:53,986 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-10-02 11:17:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:17:53,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-02 11:17:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:53,990 INFO L225 Difference]: With dead ends: 75 [2019-10-02 11:17:53,990 INFO L226 Difference]: Without dead ends: 73 [2019-10-02 11:17:53,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-02 11:17:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-10-02 11:17:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-02 11:17:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-02 11:17:54,004 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-10-02 11:17:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,005 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-02 11:17:54,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-02 11:17:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:17:54,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,008 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-10-02 11:17:54,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,053 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-02 11:17:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:54,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:54,055 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-10-02 11:17:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,162 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-10-02 11:17:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:17:54,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-02 11:17:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,164 INFO L225 Difference]: With dead ends: 96 [2019-10-02 11:17:54,164 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 11:17:54,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 11:17:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-10-02 11:17:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 11:17:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-02 11:17:54,175 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-10-02 11:17:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,176 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-02 11:17:54,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-02 11:17:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:17:54,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,178 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-10-02 11:17:54,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,246 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-02 11:17:54,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:54,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:54,248 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-10-02 11:17:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,368 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-10-02 11:17:54,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:54,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-02 11:17:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,370 INFO L225 Difference]: With dead ends: 95 [2019-10-02 11:17:54,370 INFO L226 Difference]: Without dead ends: 93 [2019-10-02 11:17:54,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 11:17:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-02 11:17:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-10-02 11:17:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 11:17:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-02 11:17:54,392 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-10-02 11:17:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,392 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-02 11:17:54,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-02 11:17:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:17:54,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,394 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-10-02 11:17:54,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,454 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-02 11:17:54,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:54,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:54,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:54,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:54,457 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-10-02 11:17:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,542 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-02 11:17:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:54,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-02 11:17:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,544 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:17:54,544 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:17:54,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:17:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-10-02 11:17:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-02 11:17:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-02 11:17:54,561 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-10-02 11:17:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,561 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-02 11:17:54,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-02 11:17:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:17:54,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,565 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-10-02 11:17:54,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,641 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-02 11:17:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:54,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:54,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:54,646 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-10-02 11:17:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,746 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-10-02 11:17:54,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:17:54,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-02 11:17:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,752 INFO L225 Difference]: With dead ends: 91 [2019-10-02 11:17:54,752 INFO L226 Difference]: Without dead ends: 89 [2019-10-02 11:17:54,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-02 11:17:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-10-02 11:17:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 11:17:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-02 11:17:54,768 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-10-02 11:17:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,769 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-02 11:17:54,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-02 11:17:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:17:54,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,774 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-10-02 11:17:54,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,868 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-02 11:17:54,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:54,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:54,870 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-10-02 11:17:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,996 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-10-02 11:17:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:54,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:17:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,997 INFO L225 Difference]: With dead ends: 73 [2019-10-02 11:17:54,998 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 11:17:54,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 11:17:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-10-02 11:17:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 11:17:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-02 11:17:55,004 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-10-02 11:17:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,005 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-02 11:17:55,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-02 11:17:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:17:55,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,006 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-10-02 11:17:55,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,068 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-02 11:17:55,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,070 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-10-02 11:17:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,164 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-02 11:17:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:55,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:17:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,166 INFO L225 Difference]: With dead ends: 61 [2019-10-02 11:17:55,166 INFO L226 Difference]: Without dead ends: 59 [2019-10-02 11:17:55,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 11:17:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-02 11:17:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-10-02 11:17:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 11:17:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-02 11:17:55,173 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-10-02 11:17:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,173 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-02 11:17:55,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-02 11:17:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:17:55,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,175 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-10-02 11:17:55,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,225 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-02 11:17:55,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:55,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:55,229 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-10-02 11:17:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,292 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-02 11:17:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:17:55,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-02 11:17:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,294 INFO L225 Difference]: With dead ends: 61 [2019-10-02 11:17:55,294 INFO L226 Difference]: Without dead ends: 59 [2019-10-02 11:17:55,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-02 11:17:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-10-02 11:17:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:17:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-02 11:17:55,305 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-10-02 11:17:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,306 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-02 11:17:55,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-02 11:17:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:17:55,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,310 INFO L411 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-02 11:17:55,311 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-10-02 11:17:55,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,389 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-02 11:17:55,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:55,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:55,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:55,391 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-10-02 11:17:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,457 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-02 11:17:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:55,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-02 11:17:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,458 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:17:55,458 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:17:55,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:17:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-10-02 11:17:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:17:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-02 11:17:55,473 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-10-02 11:17:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,473 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-02 11:17:55,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-02 11:17:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:17:55,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,477 INFO L411 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-02 11:17:55,478 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-10-02 11:17:55,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,550 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-02 11:17:55,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,552 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-10-02 11:17:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,657 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-10-02 11:17:55,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:55,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-02 11:17:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,659 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:17:55,659 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 11:17:55,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 11:17:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-10-02 11:17:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-02 11:17:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-02 11:17:55,666 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-10-02 11:17:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,668 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-02 11:17:55,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-02 11:17:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:17:55,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,670 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-10-02 11:17:55,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,742 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-02 11:17:55,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:17:55,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:55,744 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-10-02 11:17:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,880 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-10-02 11:17:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:17:55,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-02 11:17:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,882 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:17:55,882 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:17:55,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:17:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-10-02 11:17:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 11:17:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-02 11:17:55,887 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-10-02 11:17:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,887 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-02 11:17:55,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-02 11:17:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:17:55,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,893 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-10-02 11:17:55,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,954 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-02 11:17:55,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,956 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-10-02 11:17:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,085 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-10-02 11:17:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:56,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-02 11:17:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,087 INFO L225 Difference]: With dead ends: 87 [2019-10-02 11:17:56,087 INFO L226 Difference]: Without dead ends: 85 [2019-10-02 11:17:56,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-02 11:17:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-10-02 11:17:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 11:17:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-02 11:17:56,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-10-02 11:17:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,095 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-02 11:17:56,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-02 11:17:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:17:56,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,097 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-10-02 11:17:56,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,147 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-02 11:17:56,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:17:56,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:56,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:56,148 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-10-02 11:17:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,289 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-02 11:17:56,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:17:56,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-02 11:17:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,291 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:17:56,291 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 11:17:56,292 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 11:17:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-10-02 11:17:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 11:17:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-02 11:17:56,298 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-10-02 11:17:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,298 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-02 11:17:56,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-02 11:17:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:17:56,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,300 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-10-02 11:17:56,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,346 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-02 11:17:56,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:56,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:17:56,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:56,348 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-10-02 11:17:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,515 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-10-02 11:17:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:17:56,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-02 11:17:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,517 INFO L225 Difference]: With dead ends: 125 [2019-10-02 11:17:56,517 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:17:56,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:17:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:17:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:17:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:17:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:17:56,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-02 11:17:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,519 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:17:56,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:17:56,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:17:56,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:17:56,751 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-10-02 11:17:56,931 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 63 [2019-10-02 11:17:57,059 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-10-02 11:17:57,541 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 9 [2019-10-02 11:17:57,747 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-10-02 11:17:57,908 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 18 [2019-10-02 11:17:57,910 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:17:57,910 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:17:57,910 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:17:57,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:17:57,911 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:17:57,911 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:17:57,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:17:57,911 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-10-02 11:17:57,911 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-10-02 11:17:57,911 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-10-02 11:17:57,911 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-10-02 11:17:57,912 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-10-02 11:17:57,912 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-10-02 11:17:57,912 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-10-02 11:17:57,912 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-10-02 11:17:57,913 INFO L439 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= main_~__VERIFIER_assert__cond~12 0))) (and .cse3 .cse2))))) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (or (and (not (= main_~__VERIFIER_assert__cond~14 0)) .cse0 .cse1) (and (and (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0)) .cse1) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-02 11:17:57,914 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-10-02 11:17:57,915 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-10-02 11:17:57,916 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-10-02 11:17:57,917 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-10-02 11:17:57,917 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-10-02 11:17:57,917 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-10-02 11:17:57,917 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-10-02 11:17:57,917 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-10-02 11:17:57,918 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 11:17:57,918 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-10-02 11:17:57,919 INFO L439 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2019-10-02 11:17:57,919 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-10-02 11:17:57,919 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 11:17:57,919 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-02 11:17:57,919 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-10-02 11:17:57,920 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-10-02 11:17:57,921 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-10-02 11:17:57,921 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-10-02 11:17:57,921 INFO L439 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2019-10-02 11:17:57,921 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-02 11:17:57,921 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-10-02 11:17:57,921 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-10-02 11:17:57,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:17:57 BoogieIcfgContainer [2019-10-02 11:17:57,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:17:57,956 INFO L168 Benchmark]: Toolchain (without parser) took 5804.43 ms. Allocated memory was 137.4 MB in the beginning and 269.0 MB in the end (delta: 131.6 MB). Free memory was 84.8 MB in the beginning and 85.6 MB in the end (delta: -798.9 kB). Peak memory consumption was 138.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:57,957 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.4 MB. Free memory was 103.2 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:17:57,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.34 ms. Allocated memory was 137.4 MB in the beginning and 198.7 MB in the end (delta: 61.3 MB). Free memory was 84.6 MB in the beginning and 175.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:57,962 INFO L168 Benchmark]: Boogie Preprocessor took 47.40 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 173.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:57,962 INFO L168 Benchmark]: RCFGBuilder took 429.51 ms. Allocated memory is still 198.7 MB. Free memory was 173.2 MB in the beginning and 151.9 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:57,963 INFO L168 Benchmark]: TraceAbstraction took 4820.87 ms. Allocated memory was 198.7 MB in the beginning and 269.0 MB in the end (delta: 70.3 MB). Free memory was 151.3 MB in the beginning and 85.6 MB in the end (delta: 65.7 MB). Peak memory consumption was 143.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:57,967 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.26 ms. Allocated memory is still 137.4 MB. Free memory was 103.2 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 501.34 ms. Allocated memory was 137.4 MB in the beginning and 198.7 MB in the end (delta: 61.3 MB). Free memory was 84.6 MB in the beginning and 175.0 MB in the end (delta: -90.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.40 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 173.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 429.51 ms. Allocated memory is still 198.7 MB. Free memory was 173.2 MB in the beginning and 151.9 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4820.87 ms. Allocated memory was 198.7 MB in the beginning and 269.0 MB in the end (delta: 70.3 MB). Free memory was 151.3 MB in the beginning and 85.6 MB in the end (delta: 65.7 MB). Peak memory consumption was 143.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && 1 <= main__j && ((1 <= main__i && !(__VERIFIER_assert__cond == 0)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__limit + 4 <= main__bufsize) || (((main__i < main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j)) || (((1 <= main__j && ((1 <= main__i && !(__VERIFIER_assert__cond == 0)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 4.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 1254 SDslu, 796 SDs, 0 SdLazy, 795 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 84259529 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 304610 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...