/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:55:14,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:14,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:14,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:14,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:14,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:14,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:14,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:14,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:14,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:14,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:14,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:14,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:14,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:14,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:14,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:14,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:14,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:14,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:14,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:14,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:14,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:14,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:14,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:14,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:14,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:14,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:14,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:14,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:14,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:14,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:14,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:14,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:14,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:14,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:14,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:14,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:14,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:14,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:14,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:14,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:14,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:55:15,001 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:15,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:15,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:15,004 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:15,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:15,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:15,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:15,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:15,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:15,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:15,006 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:15,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:15,006 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:15,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:15,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:15,007 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:15,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:15,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:15,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:15,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:15,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:15,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:15,009 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:55:15,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:15,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:15,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:15,476 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:15,476 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:15,477 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-09-04 21:55:15,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5a1bcde3e/67c61a8cabc44a909164c571ecb829f3/FLAGaa0a56430 [2020-09-04 21:55:16,147 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:16,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-09-04 21:55:16,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5a1bcde3e/67c61a8cabc44a909164c571ecb829f3/FLAGaa0a56430 [2020-09-04 21:55:16,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5a1bcde3e/67c61a8cabc44a909164c571ecb829f3 [2020-09-04 21:55:16,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:16,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:16,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:16,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:16,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:16,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70996f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16, skipping insertion in model container [2020-09-04 21:55:16,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:16,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:16,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:16,771 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:16,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:16,812 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:16,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16 WrapperNode [2020-09-04 21:55:16,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:16,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:16,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:16,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:16,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... [2020-09-04 21:55:16,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:16,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:16,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:16,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:16,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:55:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-09-04 21:55:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 21:55:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:55:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-09-04 21:55:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:17,291 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:17,292 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:17,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:17 BoogieIcfgContainer [2020-09-04 21:55:17,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:17,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:17,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:17,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:17,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:16" (1/3) ... [2020-09-04 21:55:17,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ab5f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:17, skipping insertion in model container [2020-09-04 21:55:17,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:16" (2/3) ... [2020-09-04 21:55:17,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ab5f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:17, skipping insertion in model container [2020-09-04 21:55:17,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:17" (3/3) ... [2020-09-04 21:55:17,326 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2020-09-04 21:55:17,340 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:17,350 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:17,373 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:17,417 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:17,417 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:17,417 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:17,417 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:17,417 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:17,418 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:17,418 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:17,419 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-09-04 21:55:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:17,455 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:17,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:17,456 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 875745540, now seen corresponding path program 1 times [2020-09-04 21:55:17,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:17,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [335255256] [2020-09-04 21:55:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:17,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:17,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:55:17,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [335255256] [2020-09-04 21:55:17,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:17,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:17,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398534515] [2020-09-04 21:55:17,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:17,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:17,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:17,843 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2020-09-04 21:55:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:17,947 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-09-04 21:55:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:17,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:17,964 INFO L225 Difference]: With dead ends: 51 [2020-09-04 21:55:17,964 INFO L226 Difference]: Without dead ends: 36 [2020-09-04 21:55:17,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-04 21:55:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-04 21:55:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-04 21:55:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-09-04 21:55:18,032 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2020-09-04 21:55:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:18,033 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-09-04 21:55:18,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-09-04 21:55:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 21:55:18,036 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:18,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:18,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:18,037 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:18,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 71846672, now seen corresponding path program 1 times [2020-09-04 21:55:18,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:18,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164216097] [2020-09-04 21:55:18,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:55:18,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164216097] [2020-09-04 21:55:18,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:18,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 21:55:18,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082492579] [2020-09-04 21:55:18,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:18,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:18,282 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 8 states. [2020-09-04 21:55:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:18,401 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2020-09-04 21:55:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:55:18,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-09-04 21:55:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:18,403 INFO L225 Difference]: With dead ends: 66 [2020-09-04 21:55:18,404 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:55:18,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:55:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:55:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:55:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-09-04 21:55:18,420 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2020-09-04 21:55:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:18,420 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-09-04 21:55:18,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-09-04 21:55:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:55:18,423 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:18,424 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:18,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:18,424 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash -511991682, now seen corresponding path program 1 times [2020-09-04 21:55:18,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:18,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950237946] [2020-09-04 21:55:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:55:18,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950237946] [2020-09-04 21:55:18,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:18,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:18,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340644380] [2020-09-04 21:55:18,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:18,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:18,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:18,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:18,681 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-09-04 21:55:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:18,747 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-09-04 21:55:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:18,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 21:55:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:18,749 INFO L225 Difference]: With dead ends: 69 [2020-09-04 21:55:18,749 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:55:18,750 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:55:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-09-04 21:55:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 21:55:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 21:55:18,776 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-09-04 21:55:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:18,777 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 21:55:18,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 21:55:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:55:18,781 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:18,782 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:18,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:18,783 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1477652418, now seen corresponding path program 1 times [2020-09-04 21:55:18,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:18,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [612578650] [2020-09-04 21:55:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:55:18,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [612578650] [2020-09-04 21:55:18,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:18,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:18,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087316277] [2020-09-04 21:55:18,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:18,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:18,968 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-09-04 21:55:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:19,026 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-09-04 21:55:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:55:19,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 21:55:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:19,029 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:55:19,029 INFO L226 Difference]: Without dead ends: 49 [2020-09-04 21:55:19,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-09-04 21:55:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-09-04 21:55:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 21:55:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 21:55:19,055 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-09-04 21:55:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:19,055 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 21:55:19,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 21:55:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:55:19,059 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:19,059 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:19,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:19,062 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2109914946, now seen corresponding path program 1 times [2020-09-04 21:55:19,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:19,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748465200] [2020-09-04 21:55:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:55:19,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748465200] [2020-09-04 21:55:19,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:19,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:55:19,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786476505] [2020-09-04 21:55:19,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:55:19,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:19,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:55:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:19,365 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2020-09-04 21:55:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:19,569 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2020-09-04 21:55:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:55:19,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-09-04 21:55:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:19,572 INFO L225 Difference]: With dead ends: 90 [2020-09-04 21:55:19,572 INFO L226 Difference]: Without dead ends: 61 [2020-09-04 21:55:19,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:55:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-04 21:55:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2020-09-04 21:55:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 21:55:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-09-04 21:55:19,585 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2020-09-04 21:55:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:19,585 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-09-04 21:55:19,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:55:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-09-04 21:55:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 21:55:19,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:19,587 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-09-04 21:55:19,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:19,588 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:19,588 INFO L82 PathProgramCache]: Analyzing trace with hash 830258234, now seen corresponding path program 1 times [2020-09-04 21:55:19,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:19,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774165315] [2020-09-04 21:55:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 21:55:19,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774165315] [2020-09-04 21:55:19,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:19,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:19,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989057228] [2020-09-04 21:55:19,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:19,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:19,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:19,891 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 14 states. [2020-09-04 21:55:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:20,171 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2020-09-04 21:55:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:55:20,171 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2020-09-04 21:55:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:20,173 INFO L225 Difference]: With dead ends: 104 [2020-09-04 21:55:20,173 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 21:55:20,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:55:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 21:55:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-09-04 21:55:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 21:55:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-09-04 21:55:20,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2020-09-04 21:55:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:20,190 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-09-04 21:55:20,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-09-04 21:55:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:55:20,192 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:20,192 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2020-09-04 21:55:20,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:55:20,195 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 444280, now seen corresponding path program 2 times [2020-09-04 21:55:20,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:20,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1380281026] [2020-09-04 21:55:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 21:55:20,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1380281026] [2020-09-04 21:55:20,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:20,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:20,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562678477] [2020-09-04 21:55:20,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:20,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:20,590 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 14 states. [2020-09-04 21:55:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:20,864 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2020-09-04 21:55:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:55:20,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2020-09-04 21:55:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:20,867 INFO L225 Difference]: With dead ends: 111 [2020-09-04 21:55:20,867 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 21:55:20,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:55:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 21:55:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2020-09-04 21:55:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 21:55:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2020-09-04 21:55:20,885 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 52 [2020-09-04 21:55:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:20,886 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2020-09-04 21:55:20,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2020-09-04 21:55:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 21:55:20,888 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:20,888 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:20,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:55:20,888 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1783783324, now seen corresponding path program 2 times [2020-09-04 21:55:20,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:20,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219970133] [2020-09-04 21:55:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:55:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:20,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:21,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:21,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:21,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:21,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:55:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 21:55:21,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219970133] [2020-09-04 21:55:21,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:21,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:55:21,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302307574] [2020-09-04 21:55:21,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:55:21,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:21,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:55:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:55:21,262 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 14 states. [2020-09-04 21:55:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:21,523 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2020-09-04 21:55:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:55:21,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2020-09-04 21:55:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:21,525 INFO L225 Difference]: With dead ends: 93 [2020-09-04 21:55:21,525 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:55:21,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:55:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:55:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:55:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:55:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:55:21,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-09-04 21:55:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:21,528 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:55:21,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:55:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:55:21,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:55:21,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:21,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:55:22,436 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:55:22,437 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:55:22,440 INFO L264 CegarLoopResult]: At program point id2FINAL(lines 14 19) the Hoare annotation is: (or (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= |id2_#res| 1) (<= 1 id2_~ret~1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-09-04 21:55:22,440 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 21:55:22,441 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 21:55:22,442 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 21:55:22,442 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-09-04 21:55:22,442 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 21:55:22,443 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (or (and (<= 2 |id2_#t~ret1|) (<= |id2_#t~ret1| 2)) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|)) (and (<= 0 |id2_#t~ret1|) (<= |id2_#t~ret1| 0)) (and (<= 3 |id2_#t~ret1|) (<= |id2_#t~ret1| 3))) [2020-09-04 21:55:22,443 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 21:55:22,443 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (or (and (<= 4 id2_~ret~1) (<= 3 |id2_#t~ret1|) (<= (div id2_~ret~1 4294967296) 0) (<= |id2_#t~ret1| 3)) (and (<= 0 |id2_#t~ret1|) (<= |id2_#t~ret1| 0) (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|) (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 2 |id2_#t~ret1|) (<= |id2_#t~ret1| 2) (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 21:55:22,444 INFO L264 CegarLoopResult]: At program point id2EXIT(lines 14 19) the Hoare annotation is: (or (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= |id2_#res| 1) (<= 1 id2_~ret~1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-09-04 21:55:22,444 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2020-09-04 21:55:22,444 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:55:22,444 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:55:22,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:55:22,445 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:55:22,445 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) the Hoare annotation is: false [2020-09-04 21:55:22,446 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2020-09-04 21:55:22,446 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-09-04 21:55:22,446 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 21 27) the Hoare annotation is: true [2020-09-04 21:55:22,447 INFO L264 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: (and (<= main_~result~0 3) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-09-04 21:55:22,447 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-09-04 21:55:22,447 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 21:55:22,448 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (or (and (<= |main_#t~ret3| 3) (<= 3 |main_#t~ret3|)) (and (<= |main_#t~ret3| 0) (<= 0 |main_#t~ret3|)) (and (<= 2 |main_#t~ret3|) (<= |main_#t~ret3| 2)) (and (<= |main_#t~ret3| 1) (<= 1 |main_#t~ret3|))) [2020-09-04 21:55:22,448 INFO L271 CegarLoopResult]: At program point L24-2(lines 21 27) the Hoare annotation is: true [2020-09-04 21:55:22,449 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= |main_#t~ret3| 0) (<= main_~result~0 0) (<= 0 |main_#t~ret3|) .cse0) (and (<= main_~result~0 3) .cse0 (<= |main_#t~ret3| 3) (<= 3 |main_#t~ret3|)) (and (<= 2 |main_#t~ret3|) (<= main_~result~0 2) (<= |main_#t~ret3| 2) .cse0) (and (<= |main_#t~ret3| 1) (<= main_~result~0 1) (<= 1 |main_#t~ret3|) .cse0))) [2020-09-04 21:55:22,449 INFO L264 CegarLoopResult]: At program point idFINAL(lines 7 12) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-09-04 21:55:22,449 INFO L264 CegarLoopResult]: At program point idEXIT(lines 7 12) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-09-04 21:55:22,450 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2020-09-04 21:55:22,450 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-09-04 21:55:22,450 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-09-04 21:55:22,451 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 21:55:22,451 INFO L271 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-09-04 21:55:22,451 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-09-04 21:55:22,452 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (or (and (<= 1 |id_#t~ret0|) (<= |id_#t~ret0| 1)) (and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|)) (and (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3)) (and (<= 0 |id_#t~ret0|) (<= |id_#t~ret0| 0))) [2020-09-04 21:55:22,452 INFO L271 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-09-04 21:55:22,452 INFO L264 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3)) (and (<= |id_#t~ret0| 2) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 2 |id_#t~ret0|)) (and (<= 0 |id_#t~ret0|) (<= |id_#t~ret0| 0) (<= id_~ret~0 1) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 1 |id_#t~ret0|) (<= |id_#t~ret0| 1) (<= 2 id_~ret~0))) [2020-09-04 21:55:22,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:55:22 BoogieIcfgContainer [2020-09-04 21:55:22,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:55:22,516 INFO L168 Benchmark]: Toolchain (without parser) took 6002.87 ms. Allocated memory was 139.5 MB in the beginning and 284.2 MB in the end (delta: 144.7 MB). Free memory was 102.6 MB in the beginning and 185.4 MB in the end (delta: -82.8 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:22,517 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:55:22,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.60 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:22,521 INFO L168 Benchmark]: Boogie Preprocessor took 126.66 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 182.2 MB in the end (delta: -89.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:22,521 INFO L168 Benchmark]: RCFGBuilder took 360.82 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 169.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:22,525 INFO L168 Benchmark]: TraceAbstraction took 5191.21 ms. Allocated memory was 203.4 MB in the beginning and 284.2 MB in the end (delta: 80.7 MB). Free memory was 168.3 MB in the beginning and 185.4 MB in the end (delta: -17.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:22,534 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.25 ms. Allocated memory is still 139.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.60 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.66 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 182.2 MB in the end (delta: -89.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.82 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 169.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5191.21 ms. Allocated memory was 203.4 MB in the beginning and 284.2 MB in the end (delta: 80.7 MB). Free memory was 168.3 MB in the beginning and 185.4 MB in the end (delta: -17.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2: (((\result <= 0 && 0 <= \result) || (((\result <= 1 && 1 <= ret) && ret <= 1) && 1 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret)) || (\result <= 3 && 3 <= \result) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 7]: Procedure Contract for id Derived contract for procedure id: (((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (0 <= \result && \result <= 0)) || (\result <= 3 && 3 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 330 SDtfs, 55 SDslu, 2332 SDs, 0 SdLazy, 623 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, 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, 8 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 49 PreInvPairs, 194 NumberOfFragments, 578 HoareAnnotationTreeSize, 49 FomulaSimplifications, 4504 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 38 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 42279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 63/95 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...