/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_o10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:55:28,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:55:28,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:55:28,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:55:28,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:55:28,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:55:28,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:55:28,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:55:28,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:55:28,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:55:28,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:55:28,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:55:28,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:55:28,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:55:28,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:55:28,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:55:28,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:55:28,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:55:28,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:55:28,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:55:28,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:55:28,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:55:28,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:55:28,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:55:28,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:55:28,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:55:28,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:55:28,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:55:28,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:55:28,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:55:28,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:55:28,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:55:28,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:55:28,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:55:28,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:55:28,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:55:28,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:55:28,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:55:28,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:55:28,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:55:28,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:55:28,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:55:28,910 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:55:28,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:55:28,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:55:28,917 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:55:28,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:55:28,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:55:28,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:55:28,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:55:28,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:55:28,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:55:28,920 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:55:28,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:55:28,920 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:55:28,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:55:28,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:55:28,921 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:55:28,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:55:28,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:55:28,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:28,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:55:28,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:55:28,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:55:28,923 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-10-24 00:55:29,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:55:29,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:55:29,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:55:29,374 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:55:29,374 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:55:29,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o10.c [2020-10-24 00:55:29,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491c63527/820823dcb6c743ceb8cc535be8bfe06c/FLAG3900d99d4 [2020-10-24 00:55:30,164 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:55:30,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o10.c [2020-10-24 00:55:30,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491c63527/820823dcb6c743ceb8cc535be8bfe06c/FLAG3900d99d4 [2020-10-24 00:55:30,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491c63527/820823dcb6c743ceb8cc535be8bfe06c [2020-10-24 00:55:30,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:55:30,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:55:30,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:30,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:55:30,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:55:30,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6daaa9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30, skipping insertion in model container [2020-10-24 00:55:30,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:55:30,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:55:30,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:30,886 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:55:30,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:30,921 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:55:30,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30 WrapperNode [2020-10-24 00:55:30,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:30,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:55:30,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:55:30,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:55:30,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (1/1) ... [2020-10-24 00:55:30,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:55:30,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:55:30,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:55:30,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:55:30,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (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-10-24 00:55:31,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:55:31,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:55:31,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:55:31,048 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:55:31,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:55:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 00:55:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:55:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:55:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:55:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:55:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:55:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:55:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:55:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:55:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:55:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:55:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:55:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:55:31,296 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:55:31,297 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:55:31,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:31 BoogieIcfgContainer [2020-10-24 00:55:31,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:55:31,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:55:31,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:55:31,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:55:31,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:55:30" (1/3) ... [2020-10-24 00:55:31,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369b3ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:31, skipping insertion in model container [2020-10-24 00:55:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:30" (2/3) ... [2020-10-24 00:55:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369b3ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:31, skipping insertion in model container [2020-10-24 00:55:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:31" (3/3) ... [2020-10-24 00:55:31,312 INFO L111 eAbstractionObserver]: Analyzing ICFG id_o10.c [2020-10-24 00:55:31,326 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:55:31,332 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:55:31,353 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:55:31,431 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:55:31,432 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:55:31,432 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:55:31,432 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:55:31,432 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:55:31,433 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:55:31,436 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:55:31,436 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:55:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-10-24 00:55:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:55:31,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:31,502 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-10-24 00:55:31,503 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2039876327, now seen corresponding path program 1 times [2020-10-24 00:55:31,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:31,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953798369] [2020-10-24 00:55:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:31,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:31,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:55:32,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953798369] [2020-10-24 00:55:32,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:55:32,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:55:32,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088194959] [2020-10-24 00:55:32,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:55:32,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:55:32,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:55:32,077 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 6 states. [2020-10-24 00:55:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:32,492 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-24 00:55:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:55:32,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:55:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:32,511 INFO L225 Difference]: With dead ends: 50 [2020-10-24 00:55:32,511 INFO L226 Difference]: Without dead ends: 31 [2020-10-24 00:55:32,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-24 00:55:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-24 00:55:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-24 00:55:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-10-24 00:55:32,575 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2020-10-24 00:55:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:32,576 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-10-24 00:55:32,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:55:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-10-24 00:55:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 00:55:32,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:32,579 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] [2020-10-24 00:55:32,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:55:32,579 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1789799325, now seen corresponding path program 1 times [2020-10-24 00:55:32,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:32,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312877655] [2020-10-24 00:55:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:55:32,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312877655] [2020-10-24 00:55:32,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:32,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:55:32,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033312497] [2020-10-24 00:55:32,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:55:32,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:55:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:55:32,807 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states. [2020-10-24 00:55:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:33,203 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-10-24 00:55:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:55:33,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-10-24 00:55:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:33,205 INFO L225 Difference]: With dead ends: 41 [2020-10-24 00:55:33,206 INFO L226 Difference]: Without dead ends: 35 [2020-10-24 00:55:33,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-24 00:55:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-24 00:55:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-24 00:55:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-10-24 00:55:33,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-10-24 00:55:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:33,221 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-10-24 00:55:33,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:55:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-10-24 00:55:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-24 00:55:33,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:33,223 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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-10-24 00:55:33,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:55:33,223 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 819538851, now seen corresponding path program 2 times [2020-10-24 00:55:33,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:33,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073129336] [2020-10-24 00:55:33,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-24 00:55:33,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073129336] [2020-10-24 00:55:33,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:33,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:55:33,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450410777] [2020-10-24 00:55:33,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:55:33,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:55:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:33,471 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2020-10-24 00:55:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:34,007 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-10-24 00:55:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:55:34,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2020-10-24 00:55:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:34,009 INFO L225 Difference]: With dead ends: 45 [2020-10-24 00:55:34,009 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:55:34,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:55:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:55:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:55:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-24 00:55:34,023 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 39 [2020-10-24 00:55:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:34,023 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-24 00:55:34,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:55:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-24 00:55:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 00:55:34,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:34,031 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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-10-24 00:55:34,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:55:34,031 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1214666029, now seen corresponding path program 3 times [2020-10-24 00:55:34,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:34,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666493908] [2020-10-24 00:55:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-24 00:55:34,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666493908] [2020-10-24 00:55:34,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:34,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:55:34,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195896851] [2020-10-24 00:55:34,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:55:34,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:55:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:55:34,386 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states. [2020-10-24 00:55:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:35,320 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-24 00:55:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:55:35,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-10-24 00:55:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:35,324 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:55:35,324 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 00:55:35,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:55:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 00:55:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-24 00:55:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-24 00:55:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-10-24 00:55:35,338 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 46 [2020-10-24 00:55:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:35,339 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-10-24 00:55:35,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:55:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-10-24 00:55:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-24 00:55:35,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:35,341 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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-10-24 00:55:35,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:55:35,341 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:35,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash -461443027, now seen corresponding path program 4 times [2020-10-24 00:55:35,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:35,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537468302] [2020-10-24 00:55:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:55:35,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537468302] [2020-10-24 00:55:35,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:35,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:55:35,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237318746] [2020-10-24 00:55:35,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:55:35,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:55:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:55:35,704 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 14 states. [2020-10-24 00:55:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:36,848 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-10-24 00:55:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:55:36,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-10-24 00:55:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:36,856 INFO L225 Difference]: With dead ends: 53 [2020-10-24 00:55:36,857 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 00:55:36,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:55:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 00:55:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-24 00:55:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 00:55:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-24 00:55:36,884 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 53 [2020-10-24 00:55:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:36,885 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-24 00:55:36,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:55:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-24 00:55:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:55:36,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:36,890 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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-10-24 00:55:36,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:55:36,891 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1951577079, now seen corresponding path program 5 times [2020-10-24 00:55:36,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:36,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997602471] [2020-10-24 00:55:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 00:55:37,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997602471] [2020-10-24 00:55:37,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:37,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:55:37,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362896154] [2020-10-24 00:55:37,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:55:37,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:55:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:55:37,450 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states. [2020-10-24 00:55:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:38,855 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-10-24 00:55:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:55:38,856 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2020-10-24 00:55:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:38,858 INFO L225 Difference]: With dead ends: 57 [2020-10-24 00:55:38,858 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:55:38,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:55:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:55:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:55:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:55:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-10-24 00:55:38,876 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 60 [2020-10-24 00:55:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:38,876 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-10-24 00:55:38,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:55:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-10-24 00:55:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-24 00:55:38,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:38,878 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 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-10-24 00:55:38,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:55:38,879 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1085586761, now seen corresponding path program 6 times [2020-10-24 00:55:38,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:38,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943562167] [2020-10-24 00:55:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:38,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 00:55:39,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943562167] [2020-10-24 00:55:39,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:39,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:55:39,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972530604] [2020-10-24 00:55:39,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:55:39,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:39,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:55:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:55:39,379 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 18 states. [2020-10-24 00:55:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:41,098 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-24 00:55:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:55:41,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2020-10-24 00:55:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:41,101 INFO L225 Difference]: With dead ends: 61 [2020-10-24 00:55:41,101 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:55:41,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:55:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:55:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-24 00:55:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-24 00:55:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-10-24 00:55:41,132 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 67 [2020-10-24 00:55:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:41,135 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-10-24 00:55:41,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:55:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-10-24 00:55:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 00:55:41,138 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:41,139 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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-10-24 00:55:41,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:55:41,140 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:41,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1506086719, now seen corresponding path program 7 times [2020-10-24 00:55:41,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:41,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876413921] [2020-10-24 00:55:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-24 00:55:41,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876413921] [2020-10-24 00:55:41,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:41,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:55:41,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086685280] [2020-10-24 00:55:41,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:55:41,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:41,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:55:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:41,722 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 20 states. [2020-10-24 00:55:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:43,605 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-10-24 00:55:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:55:43,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2020-10-24 00:55:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:43,607 INFO L225 Difference]: With dead ends: 65 [2020-10-24 00:55:43,607 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:55:43,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 00:55:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:55:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:55:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:55:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-24 00:55:43,628 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 74 [2020-10-24 00:55:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:43,629 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-24 00:55:43,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:55:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-24 00:55:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:55:43,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:43,631 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 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-10-24 00:55:43,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:55:43,632 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1924014913, now seen corresponding path program 8 times [2020-10-24 00:55:43,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:43,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246813286] [2020-10-24 00:55:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-24 00:55:44,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246813286] [2020-10-24 00:55:44,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:44,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:55:44,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617056261] [2020-10-24 00:55:44,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:55:44,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:55:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:55:44,282 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 22 states. [2020-10-24 00:55:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:46,471 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-24 00:55:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 00:55:46,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2020-10-24 00:55:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:46,474 INFO L225 Difference]: With dead ends: 69 [2020-10-24 00:55:46,475 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 00:55:46,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450 [2020-10-24 00:55:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 00:55:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 00:55:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 00:55:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-10-24 00:55:46,489 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 81 [2020-10-24 00:55:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:46,489 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-10-24 00:55:46,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:55:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-10-24 00:55:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-24 00:55:46,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:46,491 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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-10-24 00:55:46,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:55:46,492 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1815934069, now seen corresponding path program 9 times [2020-10-24 00:55:46,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:46,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1298679033] [2020-10-24 00:55:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:55:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-24 00:55:47,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1298679033] [2020-10-24 00:55:47,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:47,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:55:47,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334996642] [2020-10-24 00:55:47,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:55:47,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:47,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:55:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:55:47,252 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states. [2020-10-24 00:55:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:49,835 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-10-24 00:55:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-24 00:55:49,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2020-10-24 00:55:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:49,838 INFO L225 Difference]: With dead ends: 73 [2020-10-24 00:55:49,838 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:55:49,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=199, Invalid=2771, Unknown=0, NotChecked=0, Total=2970 [2020-10-24 00:55:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:55:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-24 00:55:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 00:55:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 00:55:49,854 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 88 [2020-10-24 00:55:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:49,855 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 00:55:49,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:55:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 00:55:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-24 00:55:49,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:49,857 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 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-10-24 00:55:49,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:55:49,858 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1550347829, now seen corresponding path program 10 times [2020-10-24 00:55:49,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:49,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618072878] [2020-10-24 00:55:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:49,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:49,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:49,994 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:55:49,994 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:55:49,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:55:50,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:55:50 BoogieIcfgContainer [2020-10-24 00:55:50,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:55:50,086 INFO L168 Benchmark]: Toolchain (without parser) took 19512.94 ms. Allocated memory was 125.8 MB in the beginning and 222.3 MB in the end (delta: 96.5 MB). Free memory was 102.2 MB in the beginning and 124.1 MB in the end (delta: -21.9 MB). Peak memory consumption was 75.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:50,087 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 87.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:55:50,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.59 ms. Allocated memory is still 125.8 MB. Free memory was 101.5 MB in the beginning and 92.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:50,094 INFO L168 Benchmark]: Boogie Preprocessor took 35.07 ms. Allocated memory is still 125.8 MB. Free memory was 92.6 MB in the beginning and 91.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:50,094 INFO L168 Benchmark]: RCFGBuilder took 342.10 ms. Allocated memory is still 125.8 MB. Free memory was 91.2 MB in the beginning and 78.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:50,095 INFO L168 Benchmark]: TraceAbstraction took 18779.86 ms. Allocated memory was 125.8 MB in the beginning and 222.3 MB in the end (delta: 96.5 MB). Free memory was 78.0 MB in the beginning and 124.1 MB in the end (delta: -46.0 MB). Peak memory consumption was 51.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:50,103 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.23 ms. Allocated memory is still 125.8 MB. Free memory is still 87.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 336.59 ms. Allocated memory is still 125.8 MB. Free memory was 101.5 MB in the beginning and 92.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.07 ms. Allocated memory is still 125.8 MB. Free memory was 92.6 MB in the beginning and 91.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 342.10 ms. Allocated memory is still 125.8 MB. Free memory was 91.2 MB in the beginning and 78.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18779.86 ms. Allocated memory was 125.8 MB in the beginning and 222.3 MB in the end (delta: 96.5 MB). Free memory was 78.0 MB in the beginning and 124.1 MB in the end (delta: -46.0 MB). Peak memory consumption was 51.1 MB. 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] unsigned int input = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=10, 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] unsigned 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_o10.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.5s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 345 SDtfs, 356 SDslu, 1837 SDs, 0 SdLazy, 4343 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 660 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 145905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/1020 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...