/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.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:29:42,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:29:42,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:29:42,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:29:42,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:29:42,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:29:42,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:29:42,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:29:42,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:29:42,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:29:42,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:29:42,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:29:42,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:29:42,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:29:42,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:29:42,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:29:42,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:29:42,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:29:42,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:29:42,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:29:42,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:29:42,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:29:42,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:29:42,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:29:42,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:29:42,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:29:42,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:29:42,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:29:42,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:29:42,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:29:42,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:29:42,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:29:42,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:29:42,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:29:42,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:29:42,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:29:42,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:29:42,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:29:42,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:29:42,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:29:42,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:29:42,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:29:42,679 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:29:42,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:29:42,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:29:42,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:29:42,681 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:29:42,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:29:42,681 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:29:42,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:29:42,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:29:42,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:29:42,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:29:42,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:29:42,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:29:42,683 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:29:42,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:29:42,683 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:29:42,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:29:42,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:29:42,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:29:42,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:29:42,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:29:42,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:29:42,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:29:42,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:29:42,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:29:42,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:29:42,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:29:42,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:29:42,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:29:42,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:29:43,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:29:43,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:29:43,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:29:43,225 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:29:43,226 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:29:43,228 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-09-21 10:29:43,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1b40ef612/8c60ce7375694cf68a773a571fd7d260/FLAG7fd3abb38 [2020-09-21 10:29:43,878 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:29:43,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-09-21 10:29:43,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1b40ef612/8c60ce7375694cf68a773a571fd7d260/FLAG7fd3abb38 [2020-09-21 10:29:44,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1b40ef612/8c60ce7375694cf68a773a571fd7d260 [2020-09-21 10:29:44,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:29:44,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:29:44,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:29:44,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:29:44,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:29:44,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54535c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44, skipping insertion in model container [2020-09-21 10:29:44,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:29:44,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:29:44,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:29:44,507 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:29:44,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:29:44,552 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:29:44,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44 WrapperNode [2020-09-21 10:29:44,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:29:44,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:29:44,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:29:44,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:29:44,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (1/1) ... [2020-09-21 10:29:44,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:29:44,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:29:44,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:29:44,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:29:44,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (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-21 10:29:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:29:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:29:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-21 10:29:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-21 10:29:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:29:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:29:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-21 10:29:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-21 10:29:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-21 10:29:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:29:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:29:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:29:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:29:45,033 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:29:45,034 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 10:29:45,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:29:45 BoogieIcfgContainer [2020-09-21 10:29:45,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:29:45,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:29:45,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:29:45,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:29:45,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:29:44" (1/3) ... [2020-09-21 10:29:45,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb325f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:29:45, skipping insertion in model container [2020-09-21 10:29:45,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:29:44" (2/3) ... [2020-09-21 10:29:45,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb325f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:29:45, skipping insertion in model container [2020-09-21 10:29:45,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:29:45" (3/3) ... [2020-09-21 10:29:45,052 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-09-21 10:29:45,067 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:29:45,078 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:29:45,104 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:29:45,137 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:29:45,137 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:29:45,137 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:29:45,138 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:29:45,138 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:29:45,138 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:29:45,138 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:29:45,138 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:29:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-09-21 10:29:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-21 10:29:45,174 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:45,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:45,176 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 160437665, now seen corresponding path program 1 times [2020-09-21 10:29:45,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:45,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555822450] [2020-09-21 10:29:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,359 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-21 10:29:45,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555822450] [2020-09-21 10:29:45,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:29:45,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-21 10:29:45,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320662731] [2020-09-21 10:29:45,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-21 10:29:45,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-21 10:29:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-21 10:29:45,394 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2020-09-21 10:29:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:45,428 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2020-09-21 10:29:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-21 10:29:45,429 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-09-21 10:29:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:45,441 INFO L225 Difference]: With dead ends: 61 [2020-09-21 10:29:45,441 INFO L226 Difference]: Without dead ends: 29 [2020-09-21 10:29:45,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-21 10:29:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-09-21 10:29:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-09-21 10:29:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-09-21 10:29:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-09-21 10:29:45,499 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2020-09-21 10:29:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:45,500 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-09-21 10:29:45,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-21 10:29:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-09-21 10:29:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-21 10:29:45,501 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:45,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:45,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:29:45,502 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:45,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 89152719, now seen corresponding path program 1 times [2020-09-21 10:29:45,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:45,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1376138268] [2020-09-21 10:29:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,624 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-21 10:29:45,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1376138268] [2020-09-21 10:29:45,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:29:45,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:29:45,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217649956] [2020-09-21 10:29:45,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:29:45,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:29:45,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:29:45,629 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2020-09-21 10:29:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:45,760 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-09-21 10:29:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:29:45,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-09-21 10:29:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:45,763 INFO L225 Difference]: With dead ends: 35 [2020-09-21 10:29:45,763 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:29:45,764 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-21 10:29:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:29:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:29:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:29:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-09-21 10:29:45,778 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2020-09-21 10:29:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:45,778 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-09-21 10:29:45,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:29:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-09-21 10:29:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-21 10:29:45,779 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:45,780 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:45,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:29:45,780 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1105875316, now seen corresponding path program 1 times [2020-09-21 10:29:45,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:45,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153410978] [2020-09-21 10:29:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-21 10:29:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:45,894 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-21 10:29:45,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153410978] [2020-09-21 10:29:45,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:29:45,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:29:45,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685333975] [2020-09-21 10:29:45,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:29:45,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:29:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:29:45,898 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2020-09-21 10:29:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:46,055 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2020-09-21 10:29:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:29:46,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-09-21 10:29:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:46,057 INFO L225 Difference]: With dead ends: 48 [2020-09-21 10:29:46,057 INFO L226 Difference]: Without dead ends: 46 [2020-09-21 10:29:46,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:29:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-21 10:29:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-21 10:29:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-21 10:29:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2020-09-21 10:29:46,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2020-09-21 10:29:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:46,073 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-09-21 10:29:46,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:29:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2020-09-21 10:29:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-21 10:29:46,075 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:46,075 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:46,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:29:46,076 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash 726428669, now seen corresponding path program 1 times [2020-09-21 10:29:46,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:46,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973999441] [2020-09-21 10:29:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-21 10:29:46,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973999441] [2020-09-21 10:29:46,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:29:46,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 10:29:46,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250774270] [2020-09-21 10:29:46,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:29:46,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:46,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:29:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:29:46,174 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2020-09-21 10:29:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:46,280 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2020-09-21 10:29:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:29:46,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-09-21 10:29:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:46,282 INFO L225 Difference]: With dead ends: 55 [2020-09-21 10:29:46,283 INFO L226 Difference]: Without dead ends: 53 [2020-09-21 10:29:46,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:29:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-21 10:29:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2020-09-21 10:29:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:29:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2020-09-21 10:29:46,304 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2020-09-21 10:29:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:46,304 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2020-09-21 10:29:46,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:29:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2020-09-21 10:29:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:29:46,322 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:46,322 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:46,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:29:46,323 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash 239914697, now seen corresponding path program 1 times [2020-09-21 10:29:46,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:46,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464223528] [2020-09-21 10:29:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-21 10:29:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-21 10:29:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-21 10:29:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-21 10:29:46,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464223528] [2020-09-21 10:29:46,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:29:46,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 10:29:46,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584849776] [2020-09-21 10:29:46,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:29:46,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:29:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:29:46,503 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2020-09-21 10:29:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:46,755 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-09-21 10:29:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:29:46,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-09-21 10:29:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:46,757 INFO L225 Difference]: With dead ends: 70 [2020-09-21 10:29:46,757 INFO L226 Difference]: Without dead ends: 63 [2020-09-21 10:29:46,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:29:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-21 10:29:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-09-21 10:29:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-21 10:29:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-09-21 10:29:46,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2020-09-21 10:29:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:46,772 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-09-21 10:29:46,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:29:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-09-21 10:29:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-21 10:29:46,774 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:46,774 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 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-21 10:29:46,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:29:46,774 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1617190790, now seen corresponding path program 1 times [2020-09-21 10:29:46,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:46,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [933287352] [2020-09-21 10:29:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:29:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-21 10:29:46,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [933287352] [2020-09-21 10:29:46,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:29:46,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-21 10:29:46,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802377722] [2020-09-21 10:29:46,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:29:46,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:46,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:29:46,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:29:46,874 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-09-21 10:29:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:47,059 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2020-09-21 10:29:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:29:47,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-09-21 10:29:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:47,062 INFO L225 Difference]: With dead ends: 72 [2020-09-21 10:29:47,062 INFO L226 Difference]: Without dead ends: 70 [2020-09-21 10:29:47,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:29:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-21 10:29:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-09-21 10:29:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-21 10:29:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2020-09-21 10:29:47,083 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2020-09-21 10:29:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:47,083 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2020-09-21 10:29:47,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:29:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-09-21 10:29:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-21 10:29:47,088 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:47,089 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:47,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:29:47,089 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash 260855770, now seen corresponding path program 1 times [2020-09-21 10:29:47,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:47,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [755298369] [2020-09-21 10:29:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:29:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:29:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-21 10:29:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-21 10:29:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-21 10:29:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-21 10:29:47,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [755298369] [2020-09-21 10:29:47,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:29:47,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:29:47,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105211653] [2020-09-21 10:29:47,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:29:47,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:29:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:29:47,312 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 9 states. [2020-09-21 10:29:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:47,717 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-09-21 10:29:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:29:47,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2020-09-21 10:29:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:47,722 INFO L225 Difference]: With dead ends: 96 [2020-09-21 10:29:47,722 INFO L226 Difference]: Without dead ends: 86 [2020-09-21 10:29:47,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:29:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-21 10:29:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2020-09-21 10:29:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-21 10:29:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2020-09-21 10:29:47,750 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 56 [2020-09-21 10:29:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:47,750 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2020-09-21 10:29:47,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:29:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2020-09-21 10:29:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-21 10:29:47,754 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:47,755 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:47,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:29:47,755 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 266725463, now seen corresponding path program 1 times [2020-09-21 10:29:47,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:47,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517342505] [2020-09-21 10:29:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:29:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:29:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:29:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:29:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:29:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-21 10:29:47,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517342505] [2020-09-21 10:29:47,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:29:47,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:29:47,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187183767] [2020-09-21 10:29:47,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:29:47,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:29:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:29:47,947 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 9 states. [2020-09-21 10:29:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:48,181 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2020-09-21 10:29:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:29:48,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-09-21 10:29:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:48,187 INFO L225 Difference]: With dead ends: 89 [2020-09-21 10:29:48,187 INFO L226 Difference]: Without dead ends: 87 [2020-09-21 10:29:48,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:29:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-09-21 10:29:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2020-09-21 10:29:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-21 10:29:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2020-09-21 10:29:48,215 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 58 [2020-09-21 10:29:48,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:48,219 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2020-09-21 10:29:48,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:29:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2020-09-21 10:29:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-21 10:29:48,224 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:48,224 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 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] [2020-09-21 10:29:48,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:29:48,224 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 269972457, now seen corresponding path program 2 times [2020-09-21 10:29:48,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:48,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238995565] [2020-09-21 10:29:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:29:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:29:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:29:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:29:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:29:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-21 10:29:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-21 10:29:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-21 10:29:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-21 10:29:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2020-09-21 10:29:48,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238995565] [2020-09-21 10:29:48,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:29:48,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:29:48,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760970408] [2020-09-21 10:29:48,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:29:48,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:29:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:29:48,483 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 10 states. [2020-09-21 10:29:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:48,660 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2020-09-21 10:29:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:29:48,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2020-09-21 10:29:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:48,672 INFO L225 Difference]: With dead ends: 88 [2020-09-21 10:29:48,673 INFO L226 Difference]: Without dead ends: 79 [2020-09-21 10:29:48,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:29:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-21 10:29:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2020-09-21 10:29:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-21 10:29:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-09-21 10:29:48,693 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 81 [2020-09-21 10:29:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:48,694 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-09-21 10:29:48,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:29:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-09-21 10:29:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-09-21 10:29:48,701 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:48,701 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:48,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:29:48,702 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash 437927078, now seen corresponding path program 2 times [2020-09-21 10:29:48,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:48,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012122472] [2020-09-21 10:29:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:29:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:29:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:29:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:29:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:29:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-21 10:29:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-21 10:29:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:29:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-21 10:29:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-09-21 10:29:48,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012122472] [2020-09-21 10:29:48,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:29:48,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:29:48,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905599088] [2020-09-21 10:29:48,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:29:48,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:48,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:29:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:29:48,919 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 11 states. [2020-09-21 10:29:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:49,208 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-09-21 10:29:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:29:49,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-09-21 10:29:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:49,210 INFO L225 Difference]: With dead ends: 92 [2020-09-21 10:29:49,210 INFO L226 Difference]: Without dead ends: 90 [2020-09-21 10:29:49,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:29:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-21 10:29:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2020-09-21 10:29:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-21 10:29:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2020-09-21 10:29:49,222 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 83 [2020-09-21 10:29:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:49,222 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2020-09-21 10:29:49,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:29:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2020-09-21 10:29:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-21 10:29:49,224 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:29:49,224 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:29:49,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:29:49,225 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:29:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:29:49,225 INFO L82 PathProgramCache]: Analyzing trace with hash 331157303, now seen corresponding path program 3 times [2020-09-21 10:29:49,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:29:49,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [239652147] [2020-09-21 10:29:49,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:29:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:29:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-21 10:29:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-21 10:29:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:29:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-21 10:29:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:29:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-21 10:29:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-21 10:29:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-21 10:29:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-21 10:29:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-09-21 10:29:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-21 10:29:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-21 10:29:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 10:29:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-21 10:29:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-21 10:29:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:29:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2020-09-21 10:29:49,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [239652147] [2020-09-21 10:29:49,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:29:49,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:29:49,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468635443] [2020-09-21 10:29:49,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:29:49,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:29:49,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:29:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:29:49,548 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 13 states. [2020-09-21 10:29:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:29:49,750 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-09-21 10:29:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:29:49,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-09-21 10:29:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:29:49,753 INFO L225 Difference]: With dead ends: 83 [2020-09-21 10:29:49,753 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:29:49,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:29:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:29:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:29:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:29:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:29:49,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2020-09-21 10:29:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:29:49,760 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:29:49,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:29:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:29:49,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:29:49,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:29:49,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:29:50,350 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-21 10:29:50,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:29:50,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:29:50,351 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-21 10:29:50,351 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-21 10:29:50,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L268 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 45) no Hoare annotation was computed. [2020-09-21 10:29:50,352 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-09-21 10:29:50,353 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (and (<= 0 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,353 INFO L268 CegarLoopResult]: For program point L28(lines 28 29) no Hoare annotation was computed. [2020-09-21 10:29:50,353 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-09-21 10:29:50,353 INFO L268 CegarLoopResult]: For program point L20-1(lines 14 45) no Hoare annotation was computed. [2020-09-21 10:29:50,353 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,354 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,354 INFO L268 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2020-09-21 10:29:50,354 INFO L268 CegarLoopResult]: For program point L21(lines 14 45) no Hoare annotation was computed. [2020-09-21 10:29:50,354 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 45) no Hoare annotation was computed. [2020-09-21 10:29:50,354 INFO L268 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-09-21 10:29:50,354 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,355 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< main_~buf~0 main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,355 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-09-21 10:29:50,355 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< main_~buf~0 main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,355 INFO L268 CegarLoopResult]: For program point L26-1(lines 26 37) no Hoare annotation was computed. [2020-09-21 10:29:50,355 INFO L264 CegarLoopResult]: At program point L26-3(lines 26 37) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0)) [2020-09-21 10:29:50,355 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-09-21 10:29:50,356 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-09-21 10:29:50,356 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-21 10:29:50,356 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 0 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-21 10:29:50,356 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-21 10:29:50,356 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-09-21 10:29:50,356 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-09-21 10:29:50,357 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-09-21 10:29:50,357 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-09-21 10:29:50,357 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-09-21 10:29:50,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:29:50 BoogieIcfgContainer [2020-09-21 10:29:50,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:29:50,383 INFO L168 Benchmark]: Toolchain (without parser) took 6157.20 ms. Allocated memory was 138.4 MB in the beginning and 289.9 MB in the end (delta: 151.5 MB). Free memory was 101.7 MB in the beginning and 166.9 MB in the end (delta: -65.2 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:29:50,384 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-21 10:29:50,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.99 ms. Allocated memory is still 138.4 MB. Free memory was 101.0 MB in the beginning and 91.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:29:50,385 INFO L168 Benchmark]: Boogie Preprocessor took 121.05 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 91.3 MB in the beginning and 179.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:29:50,386 INFO L168 Benchmark]: RCFGBuilder took 364.95 ms. Allocated memory is still 200.8 MB. Free memory was 179.9 MB in the beginning and 164.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:29:50,387 INFO L168 Benchmark]: TraceAbstraction took 5337.51 ms. Allocated memory was 200.8 MB in the beginning and 289.9 MB in the end (delta: 89.1 MB). Free memory was 164.0 MB in the beginning and 166.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2020-09-21 10:29:50,391 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.29 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 323.99 ms. Allocated memory is still 138.4 MB. Free memory was 101.0 MB in the beginning and 91.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.05 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 91.3 MB in the beginning and 179.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.95 ms. Allocated memory is still 200.8 MB. Free memory was 179.9 MB in the beginning and 164.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5337.51 ms. Allocated memory was 200.8 MB in the beginning and 289.9 MB in the end (delta: 89.1 MB). Free memory was 164.0 MB in the beginning and 166.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 86.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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((0 <= buf && buf < buflim + 1) && buflim + 2 <= bufferlen) && in + buflim + 3 <= buf + inlen) && bufferlen + 1 <= inlen) && 0 <= in - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 11, TraceHistogramMax: 16, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 422 SDtfs, 351 SDslu, 1324 SDs, 0 SdLazy, 750 SolverSat, 329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 43 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 54 PreInvPairs, 91 NumberOfFragments, 206 HoareAnnotationTreeSize, 54 FomulaSimplifications, 1422 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 15 FomulaSimplificationsInter, 705 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 111624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 1182/1281 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...