/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/id_i10_o10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:02,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:02,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:02,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:02,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:02,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:02,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:02,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:02,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:02,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:02,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:02,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:02,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:02,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:02,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:02,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:02,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:02,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:02,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:02,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:02,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:02,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:02,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:02,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:02,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:02,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:02,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:02,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:02,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:02,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:02,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:02,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:02,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:02,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:02,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:02,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:02,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:02,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:02,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:02,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:02,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:02,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:07:02,837 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:02,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:02,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:02,844 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:02,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:02,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:02,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:02,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:02,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:02,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:02,846 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:02,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:02,846 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:02,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:02,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:02,847 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:02,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:02,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:02,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:02,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:02,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:02,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:02,851 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 05:07:03,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:03,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:03,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:03,334 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:03,335 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:03,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-11-07 05:07:03,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dc88c2a/af0ab4daba28428d992afbcae122a0a1/FLAG1d5d3c660 [2020-11-07 05:07:04,147 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:04,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-11-07 05:07:04,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dc88c2a/af0ab4daba28428d992afbcae122a0a1/FLAG1d5d3c660 [2020-11-07 05:07:04,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0dc88c2a/af0ab4daba28428d992afbcae122a0a1 [2020-11-07 05:07:04,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:04,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:04,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:04,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:04,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:04,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9f7615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04, skipping insertion in model container [2020-11-07 05:07:04,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:04,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:04,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:04,782 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:04,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:04,823 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:04,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04 WrapperNode [2020-11-07 05:07:04,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:04,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:04,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:04,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:04,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... [2020-11-07 05:07:04,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:04,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:04,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:04,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:04,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:04,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:04,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:04,969 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:04,969 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:04,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:07:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:05,518 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:05,519 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:05,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:05 BoogieIcfgContainer [2020-11-07 05:07:05,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:05,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:05,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:05,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:05,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:04" (1/3) ... [2020-11-07 05:07:05,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a6dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:05, skipping insertion in model container [2020-11-07 05:07:05,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:04" (2/3) ... [2020-11-07 05:07:05,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a6dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:05, skipping insertion in model container [2020-11-07 05:07:05,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:05" (3/3) ... [2020-11-07 05:07:05,543 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2020-11-07 05:07:05,563 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:05,567 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:05,585 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:05,632 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:05,633 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:05,633 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:05,633 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:05,633 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:05,633 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:05,634 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:05,634 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 05:07:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:05,671 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:05,673 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-11-07 05:07:05,674 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 05:07:05,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:05,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2134227533] [2020-11-07 05:07:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:06,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:06,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:07:06,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2134227533] [2020-11-07 05:07:06,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:06,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:06,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391632660] [2020-11-07 05:07:06,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:06,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:06,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:06,188 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 05:07:06,661 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-07 05:07:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:06,848 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 05:07:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:06,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:06,862 INFO L225 Difference]: With dead ends: 52 [2020-11-07 05:07:06,863 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 05:07:06,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 05:07:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 05:07:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 05:07:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 05:07:06,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 05:07:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:06,935 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 05:07:06,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 05:07:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 05:07:06,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:06,938 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] [2020-11-07 05:07:06,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:06,939 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:06,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 05:07:06,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:06,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348722087] [2020-11-07 05:07:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:07,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348722087] [2020-11-07 05:07:07,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:07,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:07:07,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412067493] [2020-11-07 05:07:07,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:07:07,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:07,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:07:07,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:07:07,187 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 05:07:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:07,489 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 05:07:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:07,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 05:07:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:07,491 INFO L225 Difference]: With dead ends: 44 [2020-11-07 05:07:07,492 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:07:07,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:07:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:07:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:07:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 05:07:07,508 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 05:07:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:07,509 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 05:07:07,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:07:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 05:07:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:07:07,511 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:07,511 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:07,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:07,512 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:07,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 05:07:07,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:07,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013997875] [2020-11-07 05:07:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:07,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013997875] [2020-11-07 05:07:07,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:07,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:07,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537907991] [2020-11-07 05:07:07,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:07,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:07,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:07,709 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 05:07:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:08,093 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:07:08,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 05:07:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:08,096 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:08,096 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 05:07:08,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 05:07:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 05:07:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 05:07:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 05:07:08,114 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 05:07:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:08,115 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 05:07:08,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 05:07:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:07:08,117 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:08,117 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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-11-07 05:07:08,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:08,117 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 05:07:08,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:08,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203327389] [2020-11-07 05:07:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:08,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203327389] [2020-11-07 05:07:08,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:08,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:07:08,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176051834] [2020-11-07 05:07:08,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:07:08,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:07:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:08,445 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 05:07:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:08,865 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 05:07:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:07:08,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 05:07:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:08,868 INFO L225 Difference]: With dead ends: 54 [2020-11-07 05:07:08,869 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:08,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:08,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 05:07:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:08,887 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:08,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:07:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:07:08,889 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:08,889 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:08,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:08,890 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 05:07:08,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:08,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379710171] [2020-11-07 05:07:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:08,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:09,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379710171] [2020-11-07 05:07:09,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:09,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:09,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133199517] [2020-11-07 05:07:09,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:09,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:09,108 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 05:07:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:09,571 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 05:07:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:09,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 05:07:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:09,574 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:07:09,574 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 05:07:09,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 05:07:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 05:07:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 05:07:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 05:07:09,606 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 05:07:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:09,607 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 05:07:09,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 05:07:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:07:09,609 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:09,609 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:09,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:09,610 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 05:07:09,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:09,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815958519] [2020-11-07 05:07:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:09,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815958519] [2020-11-07 05:07:09,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:09,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:07:09,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620145948] [2020-11-07 05:07:09,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:07:09,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:07:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:09,857 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 05:07:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:10,318 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 05:07:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:07:10,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 05:07:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:10,323 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:07:10,323 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 05:07:10,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 05:07:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 05:07:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:07:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 05:07:10,339 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 05:07:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:10,340 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 05:07:10,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:07:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 05:07:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:07:10,342 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:10,342 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:10,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:10,342 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 05:07:10,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:10,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153129560] [2020-11-07 05:07:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:10,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153129560] [2020-11-07 05:07:10,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:10,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:10,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939711156] [2020-11-07 05:07:10,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:10,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:10,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:10,614 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 05:07:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:11,193 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:07:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:07:11,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 05:07:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:11,196 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:07:11,196 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 05:07:11,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 05:07:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 05:07:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:07:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 05:07:11,213 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 05:07:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:11,214 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 05:07:11,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 05:07:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:07:11,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:11,216 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:11,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:11,217 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 05:07:11,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:11,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847079480] [2020-11-07 05:07:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:11,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847079480] [2020-11-07 05:07:11,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:11,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:07:11,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791020448] [2020-11-07 05:07:11,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:07:11,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:11,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:07:11,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:11,571 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 05:07:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:12,235 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 05:07:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:12,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 05:07:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:12,238 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:07:12,238 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:07:12,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:12,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:07:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:07:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:07:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:07:12,275 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 05:07:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:12,275 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:07:12,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:07:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:07:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:07:12,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:12,279 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:12,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:07:12,280 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 05:07:12,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:12,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777476587] [2020-11-07 05:07:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:07:12,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777476587] [2020-11-07 05:07:12,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:12,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:12,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099820077] [2020-11-07 05:07:12,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:12,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:12,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:12,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:12,664 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 05:07:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:13,347 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 05:07:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:07:13,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 05:07:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:13,352 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:07:13,352 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 05:07:13,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 05:07:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 05:07:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 05:07:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 05:07:13,375 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 05:07:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:13,375 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 05:07:13,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 05:07:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:07:13,377 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:13,377 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:13,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:07:13,377 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 05:07:13,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:13,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670015446] [2020-11-07 05:07:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:07:13,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670015446] [2020-11-07 05:07:13,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:13,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:07:13,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498594803] [2020-11-07 05:07:13,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:07:13,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:07:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:13,760 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 05:07:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:14,486 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 05:07:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:07:14,486 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 05:07:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:14,488 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:07:14,488 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:07:14,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:07:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:07:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 05:07:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:07:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:07:14,518 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 05:07:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:14,518 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:07:14,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:07:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:07:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:07:14,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:14,520 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:14,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:07:14,520 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 05:07:14,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:14,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [292367077] [2020-11-07 05:07:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:07:14,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:07:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:07:14,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:07:14,638 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:07:14,638 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:07:14,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:07:14,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:07:14 BoogieIcfgContainer [2020-11-07 05:07:14,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:07:14,755 INFO L168 Benchmark]: Toolchain (without parser) took 10238.67 ms. Allocated memory was 151.0 MB in the beginning and 251.7 MB in the end (delta: 100.7 MB). Free memory was 127.2 MB in the beginning and 223.7 MB in the end (delta: -96.5 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:14,756 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 124.6 MB in the end (delta: 235.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:07:14,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.77 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 117.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:14,763 INFO L168 Benchmark]: Boogie Preprocessor took 42.20 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:14,764 INFO L168 Benchmark]: RCFGBuilder took 655.54 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 103.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:14,765 INFO L168 Benchmark]: TraceAbstraction took 9222.93 ms. Allocated memory was 151.0 MB in the beginning and 251.7 MB in the end (delta: 100.7 MB). Free memory was 102.7 MB in the beginning and 223.7 MB in the end (delta: -121.1 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:07:14,771 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 151.0 MB. Free memory was 124.8 MB in the beginning and 124.6 MB in the end (delta: 235.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 301.77 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 117.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.20 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 655.54 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 103.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9222.93 ms. Allocated memory was 151.0 MB in the beginning and 251.7 MB in the end (delta: 100.7 MB). Free memory was 102.7 MB in the beginning and 223.7 MB in the end (delta: -121.1 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 10; VAL [input=10] [L13] CALL, EXPR id(input) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 VAL [\old(x)=0, x=0] [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L13] RET, EXPR id(input) VAL [id(input)=10, input=10] [L13] int result = id(input); VAL [id(input)=10, input=10, result=10] [L14] COND TRUE result == 10 VAL [input=10, result=10] [L15] CALL reach_error() [L4] __assert_fail("0", "id_i10_o10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.0s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 640 SDslu, 572 SDs, 0 SdLazy, 824 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 112368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/1140 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 incorrect! Received shutdown request...