/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_build.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:14:30,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:14:30,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:14:30,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:14:30,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:14:30,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:14:30,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:14:30,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:14:30,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:14:30,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:14:30,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:14:30,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:14:30,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:14:30,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:14:30,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:14:30,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:14:30,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:14:30,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:14:30,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:14:30,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:14:30,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:14:30,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:14:30,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:14:30,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:14:30,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:14:30,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:14:30,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:14:30,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:14:30,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:14:30,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:14:30,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:14:30,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:14:30,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:14:30,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:14:30,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:14:30,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:14:30,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:14:30,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:14:30,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:14:30,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:14:30,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:14:30,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:14:30,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:14:30,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:14:30,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:14:30,866 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:14:30,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:14:30,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:14:30,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:14:30,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:14:30,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:14:30,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:14:30,868 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:14:30,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:14:30,869 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:14:30,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:14:30,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:14:30,870 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:14:30,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:14:30,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:14:30,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:14:30,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:14:30,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:14:30,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:14:30,871 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:14:31,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:14:31,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:14:31,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:14:31,389 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:14:31,390 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:14:31,391 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i [2020-09-04 23:14:31,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b5f8dcd22/11f1dcea08e84b478a99a755ea776ab8/FLAG9ce870ba2 [2020-09-04 23:14:32,014 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:14:32,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/id_build.i [2020-09-04 23:14:32,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b5f8dcd22/11f1dcea08e84b478a99a755ea776ab8/FLAG9ce870ba2 [2020-09-04 23:14:32,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b5f8dcd22/11f1dcea08e84b478a99a755ea776ab8 [2020-09-04 23:14:32,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:14:32,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:14:32,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:14:32,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:14:32,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:14:32,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36345b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32, skipping insertion in model container [2020-09-04 23:14:32,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:14:32,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:14:32,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:14:32,643 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:14:32,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:14:32,678 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:14:32,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32 WrapperNode [2020-09-04 23:14:32,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:14:32,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:14:32,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:14:32,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:14:32,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... [2020-09-04 23:14:32,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:14:32,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:14:32,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:14:32,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:14:32,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 23:14:32,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:14:32,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:14:32,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:14:32,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:14:32,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:14:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:14:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:14:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:14:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:14:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:14:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:14:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:14:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:14:33,109 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:14:33,109 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 23:14:33,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:14:33 BoogieIcfgContainer [2020-09-04 23:14:33,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:14:33,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:14:33,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:14:33,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:14:33,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:14:32" (1/3) ... [2020-09-04 23:14:33,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a4491d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:14:33, skipping insertion in model container [2020-09-04 23:14:33,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:14:32" (2/3) ... [2020-09-04 23:14:33,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a4491d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:14:33, skipping insertion in model container [2020-09-04 23:14:33,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:14:33" (3/3) ... [2020-09-04 23:14:33,125 INFO L109 eAbstractionObserver]: Analyzing ICFG id_build.i [2020-09-04 23:14:33,138 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:14:33,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:14:33,199 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:14:33,262 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:14:33,262 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:14:33,262 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:14:33,263 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:14:33,263 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:14:33,263 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:14:33,263 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:14:33,263 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:14:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-09-04 23:14:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 23:14:33,298 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:33,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:33,299 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2141903635, now seen corresponding path program 1 times [2020-09-04 23:14:33,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:33,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899218891] [2020-09-04 23:14:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:33,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:33,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899218891] [2020-09-04 23:14:33,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:33,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:14:33,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539053495] [2020-09-04 23:14:33,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:14:33,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:14:33,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:14:33,599 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2020-09-04 23:14:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:33,701 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2020-09-04 23:14:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:14:33,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-09-04 23:14:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:33,714 INFO L225 Difference]: With dead ends: 60 [2020-09-04 23:14:33,714 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 23:14:33,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:14:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 23:14:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 23:14:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 23:14:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 23:14:33,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 19 [2020-09-04 23:14:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:33,767 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 23:14:33,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:14:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 23:14:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 23:14:33,768 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:33,768 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:33,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:14:33,769 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:33,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1520201371, now seen corresponding path program 1 times [2020-09-04 23:14:33,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:33,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626021658] [2020-09-04 23:14:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:33,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:33,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:33,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626021658] [2020-09-04 23:14:33,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:33,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:14:33,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238665944] [2020-09-04 23:14:33,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:14:33,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:14:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:14:33,898 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 5 states. [2020-09-04 23:14:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:33,970 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-09-04 23:14:33,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:14:33,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-09-04 23:14:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:33,974 INFO L225 Difference]: With dead ends: 49 [2020-09-04 23:14:33,974 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 23:14:33,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:14:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 23:14:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-09-04 23:14:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 23:14:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-09-04 23:14:33,996 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 24 [2020-09-04 23:14:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:33,997 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-09-04 23:14:33,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:14:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-09-04 23:14:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 23:14:34,000 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:34,000 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:34,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:14:34,001 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1589830701, now seen corresponding path program 1 times [2020-09-04 23:14:34,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:34,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251760182] [2020-09-04 23:14:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 23:14:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:14:34,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251760182] [2020-09-04 23:14:34,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:34,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 23:14:34,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55517496] [2020-09-04 23:14:34,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 23:14:34,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 23:14:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:14:34,049 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2020-09-04 23:14:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:34,078 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-09-04 23:14:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 23:14:34,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-09-04 23:14:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:34,080 INFO L225 Difference]: With dead ends: 76 [2020-09-04 23:14:34,081 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 23:14:34,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:14:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 23:14:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2020-09-04 23:14:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 23:14:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-09-04 23:14:34,096 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 30 [2020-09-04 23:14:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:34,096 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-09-04 23:14:34,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 23:14:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2020-09-04 23:14:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 23:14:34,098 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:34,099 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:34,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:14:34,099 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash 156681780, now seen corresponding path program 1 times [2020-09-04 23:14:34,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:34,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465256675] [2020-09-04 23:14:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 23:14:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 23:14:34,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465256675] [2020-09-04 23:14:34,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:34,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 23:14:34,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15006407] [2020-09-04 23:14:34,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:14:34,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:34,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:14:34,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:14:34,197 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2020-09-04 23:14:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:34,274 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-09-04 23:14:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:14:34,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-09-04 23:14:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:34,277 INFO L225 Difference]: With dead ends: 89 [2020-09-04 23:14:34,277 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 23:14:34,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 23:14:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2020-09-04 23:14:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 23:14:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-09-04 23:14:34,298 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 44 [2020-09-04 23:14:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:34,299 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-09-04 23:14:34,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:14:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-09-04 23:14:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 23:14:34,301 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:34,301 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:34,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:14:34,302 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1839058219, now seen corresponding path program 2 times [2020-09-04 23:14:34,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:34,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985343500] [2020-09-04 23:14:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 23:14:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 23:14:34,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985343500] [2020-09-04 23:14:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:34,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 23:14:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649670658] [2020-09-04 23:14:34,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:34,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:34,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:34,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:34,487 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 7 states. [2020-09-04 23:14:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:34,648 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2020-09-04 23:14:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:14:34,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2020-09-04 23:14:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:34,652 INFO L225 Difference]: With dead ends: 107 [2020-09-04 23:14:34,652 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 23:14:34,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:14:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 23:14:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2020-09-04 23:14:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-09-04 23:14:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2020-09-04 23:14:34,676 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 58 [2020-09-04 23:14:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:34,677 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2020-09-04 23:14:34,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2020-09-04 23:14:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 23:14:34,680 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:34,680 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:34,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:14:34,681 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash -101962, now seen corresponding path program 3 times [2020-09-04 23:14:34,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:34,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376583194] [2020-09-04 23:14:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 23:14:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:14:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 23:14:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 23:14:34,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376583194] [2020-09-04 23:14:34,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:34,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:14:34,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606319870] [2020-09-04 23:14:34,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:14:34,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:14:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:14:34,824 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 9 states. [2020-09-04 23:14:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:35,023 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2020-09-04 23:14:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:14:35,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-09-04 23:14:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:35,030 INFO L225 Difference]: With dead ends: 125 [2020-09-04 23:14:35,030 INFO L226 Difference]: Without dead ends: 91 [2020-09-04 23:14:35,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:14:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-09-04 23:14:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2020-09-04 23:14:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 23:14:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2020-09-04 23:14:35,069 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 72 [2020-09-04 23:14:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:35,069 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2020-09-04 23:14:35,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:14:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2020-09-04 23:14:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 23:14:35,075 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:35,075 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:35,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:14:35,075 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1976659241, now seen corresponding path program 4 times [2020-09-04 23:14:35,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:35,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720979311] [2020-09-04 23:14:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 23:14:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:14:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:14:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 23:14:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 33 proven. 40 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-09-04 23:14:35,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720979311] [2020-09-04 23:14:35,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:35,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 23:14:35,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14909859] [2020-09-04 23:14:35,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:14:35,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:14:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:14:35,345 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 11 states. [2020-09-04 23:14:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:35,537 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2020-09-04 23:14:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:14:35,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2020-09-04 23:14:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:35,541 INFO L225 Difference]: With dead ends: 143 [2020-09-04 23:14:35,541 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 23:14:35,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-09-04 23:14:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 23:14:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2020-09-04 23:14:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 23:14:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-09-04 23:14:35,565 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 86 [2020-09-04 23:14:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:35,565 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-09-04 23:14:35,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:14:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-09-04 23:14:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 23:14:35,567 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:35,568 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:35,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:14:35,568 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1582933560, now seen corresponding path program 5 times [2020-09-04 23:14:35,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:35,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [986460375] [2020-09-04 23:14:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 23:14:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:14:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:14:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:14:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 23:14:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 23:14:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 40 proven. 65 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-09-04 23:14:35,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [986460375] [2020-09-04 23:14:35,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:35,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 23:14:35,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246261725] [2020-09-04 23:14:35,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:14:35,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:14:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:14:35,781 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 13 states. [2020-09-04 23:14:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:36,038 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2020-09-04 23:14:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 23:14:36,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-09-04 23:14:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:36,041 INFO L225 Difference]: With dead ends: 161 [2020-09-04 23:14:36,041 INFO L226 Difference]: Without dead ends: 115 [2020-09-04 23:14:36,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2020-09-04 23:14:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-09-04 23:14:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2020-09-04 23:14:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 23:14:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2020-09-04 23:14:36,062 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 100 [2020-09-04 23:14:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:36,063 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2020-09-04 23:14:36,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:14:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2020-09-04 23:14:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-04 23:14:36,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:36,065 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:36,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:14:36,065 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1615510489, now seen corresponding path program 6 times [2020-09-04 23:14:36,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:36,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521271087] [2020-09-04 23:14:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 23:14:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:14:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:14:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:14:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 23:14:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:14:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:14:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 23:14:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 47 proven. 96 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-09-04 23:14:36,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521271087] [2020-09-04 23:14:36,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:36,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 23:14:36,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492748533] [2020-09-04 23:14:36,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 23:14:36,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 23:14:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:14:36,296 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 15 states. [2020-09-04 23:14:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:36,627 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2020-09-04 23:14:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:14:36,627 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 114 [2020-09-04 23:14:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:36,630 INFO L225 Difference]: With dead ends: 179 [2020-09-04 23:14:36,630 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 23:14:36,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-09-04 23:14:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 23:14:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-09-04 23:14:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 23:14:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2020-09-04 23:14:36,651 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 114 [2020-09-04 23:14:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:36,651 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2020-09-04 23:14:36,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 23:14:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2020-09-04 23:14:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 23:14:36,653 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:36,654 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 8, 8, 8, 8, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:36,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:14:36,654 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 724624314, now seen corresponding path program 7 times [2020-09-04 23:14:36,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:36,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502465459] [2020-09-04 23:14:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 23:14:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:14:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:14:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:14:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 23:14:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:14:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:14:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:14:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:14:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-09-04 23:14:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 54 proven. 133 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 23:14:36,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502465459] [2020-09-04 23:14:36,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:14:36,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 23:14:36,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647730376] [2020-09-04 23:14:36,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 23:14:36,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:36,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 23:14:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:14:36,933 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand 17 states. [2020-09-04 23:14:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:37,318 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-09-04 23:14:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:14:37,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2020-09-04 23:14:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:37,323 INFO L225 Difference]: With dead ends: 189 [2020-09-04 23:14:37,323 INFO L226 Difference]: Without dead ends: 131 [2020-09-04 23:14:37,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2020-09-04 23:14:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-09-04 23:14:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-09-04 23:14:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-09-04 23:14:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2020-09-04 23:14:37,348 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 128 [2020-09-04 23:14:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:37,350 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2020-09-04 23:14:37,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 23:14:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2020-09-04 23:14:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-04 23:14:37,355 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:14:37,355 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:14:37,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:14:37,355 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:14:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:14:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1386163675, now seen corresponding path program 8 times [2020-09-04 23:14:37,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:14:37,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114919370] [2020-09-04 23:14:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:14:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:14:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:14:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:14:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 23:14:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:14:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 23:14:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:14:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 23:14:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:14:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:14:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 23:14:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:14:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 23:14:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 23:14:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:14:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 23:14:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 23:14:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:14:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:14:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2020-09-04 23:14:37,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114919370] [2020-09-04 23:14:37,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:14:37,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:14:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205971166] [2020-09-04 23:14:37,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:14:37,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:14:37,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:14:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:14:37,574 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 7 states. [2020-09-04 23:14:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:14:37,679 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2020-09-04 23:14:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:14:37,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2020-09-04 23:14:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:14:37,681 INFO L225 Difference]: With dead ends: 133 [2020-09-04 23:14:37,681 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:14:37,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:14:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:14:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:14:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:14:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:14:37,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-09-04 23:14:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:14:37,683 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:14:37,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:14:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:14:37,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:14:37,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:14:37,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:14:37,943 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-09-04 23:14:38,055 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-09-04 23:14:38,320 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2020-09-04 23:14:38,488 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-09-04 23:14:38,752 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2020-09-04 23:14:38,959 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2020-09-04 23:14:39,248 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 12 [2020-09-04 23:14:39,430 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2020-09-04 23:14:39,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:14:39,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:14:39,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:14:39,445 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 23:14:39,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:14:39,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:14:39,446 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:14:39,446 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:14:39,447 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 23:14:39,447 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 23:14:39,447 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:14:39,447 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 23) the Hoare annotation is: true [2020-09-04 23:14:39,448 INFO L264 CegarLoopResult]: At program point L19(lines 17 20) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (<= main_~j~0 7) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,448 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,448 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 23:14:39,448 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 23:14:39,449 INFO L264 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (<= main_~j~0 7) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,450 INFO L264 CegarLoopResult]: At program point L17-4(line 17) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,450 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 23) the Hoare annotation is: true [2020-09-04 23:14:39,450 INFO L264 CegarLoopResult]: At program point L17-5(lines 17 20) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,450 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-09-04 23:14:39,450 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (<= main_~j~0 7) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,451 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (and (< 0 (+ main_~i~0 1)) (<= main_~j~0 7) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,451 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 23:14:39,451 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-09-04 23:14:39,451 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-09-04 23:14:39,451 INFO L264 CegarLoopResult]: At program point L16-3(lines 16 21) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,452 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-09-04 23:14:39,452 INFO L264 CegarLoopResult]: At program point L16-4(line 16) the Hoare annotation is: (and (<= 0 main_~i~0) (<= 0 |main_#t~post1|) (< main_~i~0 main_~nlen~0)) [2020-09-04 23:14:39,452 INFO L271 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: true [2020-09-04 23:14:39,453 INFO L264 CegarLoopResult]: At program point L16-5(line 16) the Hoare annotation is: (and (<= 1 main_~i~0) (<= 0 |main_#t~post1|)) [2020-09-04 23:14:39,453 INFO L264 CegarLoopResult]: At program point L16-6(lines 16 21) the Hoare annotation is: (<= 0 main_~i~0) [2020-09-04 23:14:39,453 INFO L271 CegarLoopResult]: At program point L16-7(lines 16 21) the Hoare annotation is: true [2020-09-04 23:14:39,453 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 23:14:39,453 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:14:39,453 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:14:39,454 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:14:39,454 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:14:39,455 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:14:39,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:14:39 BoogieIcfgContainer [2020-09-04 23:14:39,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:14:39,506 INFO L168 Benchmark]: Toolchain (without parser) took 7131.23 ms. Allocated memory was 138.9 MB in the beginning and 287.3 MB in the end (delta: 148.4 MB). Free memory was 103.1 MB in the beginning and 111.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 155.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:39,506 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:14:39,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.88 ms. Allocated memory is still 138.9 MB. Free memory was 102.9 MB in the beginning and 93.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:39,508 INFO L168 Benchmark]: Boogie Preprocessor took 110.95 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.5 MB in the beginning and 181.8 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:39,509 INFO L168 Benchmark]: RCFGBuilder took 319.47 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 167.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:39,510 INFO L168 Benchmark]: TraceAbstraction took 6387.65 ms. Allocated memory was 201.9 MB in the beginning and 287.3 MB in the end (delta: 85.5 MB). Free memory was 166.8 MB in the beginning and 111.5 MB in the end (delta: 55.3 MB). Peak memory consumption was 156.2 MB. Max. memory is 7.1 GB. [2020-09-04 23:14:39,513 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.88 ms. Allocated memory is still 138.9 MB. Free memory was 102.9 MB in the beginning and 93.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.95 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.5 MB in the beginning and 181.8 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.47 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 167.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6387.65 ms. Allocated memory was 201.9 MB in the beginning and 287.3 MB in the end (delta: 85.5 MB). Free memory was 166.8 MB in the beginning and 111.5 MB in the end (delta: 55.3 MB). Peak memory consumption was 156.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 <= i && i < nlen - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 <= i - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.4s, OverallIterations: 11, TraceHistogramMax: 18, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 393 SDtfs, 133 SDslu, 1162 SDs, 0 SdLazy, 414 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 580 PreInvPairs, 756 NumberOfFragments, 144 HoareAnnotationTreeSize, 580 FomulaSimplifications, 21629 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 34 FomulaSimplificationsInter, 10425 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 130448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 2251/2615 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...