./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:16:02,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:16:02,988 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-24 23:16:03,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:16:03,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:16:03,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:16:03,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:16:03,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:16:03,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:16:03,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:16:03,052 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:16:03,053 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:16:03,054 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:16:03,056 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:16:03,056 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:16:03,057 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:16:03,057 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:16:03,057 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:16:03,058 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:16:03,059 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:16:03,059 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:16:03,060 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:16:03,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:16:03,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:16:03,062 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:16:03,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:16:03,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:16:03,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:16:03,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:16:03,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:16:03,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:16:03,066 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:16:03,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:16:03,066 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:16:03,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:16:03,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:16:03,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:16:03,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:16:03,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:16:03,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:16:03,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:16:03,069 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:16:03,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:16:03,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:16:03,070 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:16:03,071 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:16:03,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:16:03,071 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 [2023-11-24 23:16:03,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:16:03,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:16:03,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:16:03,386 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:16:03,387 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:16:03,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i [2023-11-24 23:16:06,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:16:06,666 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:16:06,670 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i [2023-11-24 23:16:06,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/data/3cf2cd559/6468626610234611af4749c1f7050a9c/FLAGab60fbe12 [2023-11-24 23:16:06,697 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/data/3cf2cd559/6468626610234611af4749c1f7050a9c [2023-11-24 23:16:06,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:16:06,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:16:06,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:16:06,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:16:06,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:16:06,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:06,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394d31f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06, skipping insertion in model container [2023-11-24 23:16:06,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:06,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:16:06,903 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i[1898,1911] [2023-11-24 23:16:06,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:16:06,931 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:16:06,945 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i[1898,1911] [2023-11-24 23:16:06,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:16:06,972 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:16:06,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06 WrapperNode [2023-11-24 23:16:06,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:16:06,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:16:06,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:16:06,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:16:06,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:06,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,008 INFO L138 Inliner]: procedures = 18, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2023-11-24 23:16:07,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:16:07,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:16:07,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:16:07,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:16:07,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:16:07,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:16:07,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:16:07,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:16:07,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (1/1) ... [2023-11-24 23:16:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:16:07,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:16:07,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:16:07,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:16:07,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:16:07,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:16:07,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:16:07,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:16:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2023-11-24 23:16:07,136 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2023-11-24 23:16:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2023-11-24 23:16:07,136 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2023-11-24 23:16:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:16:07,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:16:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:16:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:16:07,273 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:16:07,275 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:16:07,580 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:16:07,681 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:16:07,682 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 23:16:07,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:16:07 BoogieIcfgContainer [2023-11-24 23:16:07,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:16:07,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:16:07,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:16:07,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:16:07,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:16:06" (1/3) ... [2023-11-24 23:16:07,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c58ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:16:07, skipping insertion in model container [2023-11-24 23:16:07,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:16:06" (2/3) ... [2023-11-24 23:16:07,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c58ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:16:07, skipping insertion in model container [2023-11-24 23:16:07,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:16:07" (3/3) ... [2023-11-24 23:16:07,705 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_3.i [2023-11-24 23:16:07,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:16:07,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 23:16:07,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:16:07,800 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4cf10c0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:16:07,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 23:16:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 23:16:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 23:16:07,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:16:07,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:16:07,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:16:07,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:16:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 743192526, now seen corresponding path program 1 times [2023-11-24 23:16:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:16:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601250384] [2023-11-24 23:16:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:16:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:16:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:16:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:16:08,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:16:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601250384] [2023-11-24 23:16:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601250384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:16:08,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:16:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:16:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672445604] [2023-11-24 23:16:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:16:08,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:16:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:16:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:16:08,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:16:08,564 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:16:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:16:08,718 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2023-11-24 23:16:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:16:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-24 23:16:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:16:08,730 INFO L225 Difference]: With dead ends: 38 [2023-11-24 23:16:08,730 INFO L226 Difference]: Without dead ends: 18 [2023-11-24 23:16:08,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:16:08,737 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:16:08,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:16:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-24 23:16:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-24 23:16:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:16:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-11-24 23:16:08,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2023-11-24 23:16:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:16:08,777 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-11-24 23:16:08,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:16:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-11-24 23:16:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:16:08,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:16:08,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:16:08,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:16:08,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:16:08,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:16:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1068795354, now seen corresponding path program 1 times [2023-11-24 23:16:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:16:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890572421] [2023-11-24 23:16:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:16:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:16:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:16:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:16:10,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:16:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890572421] [2023-11-24 23:16:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890572421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:16:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003470057] [2023-11-24 23:16:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:16:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:16:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:16:10,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:16:10,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:16:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:16:10,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-24 23:16:10,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:16:10,277 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:16:10,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-24 23:16:12,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:12,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 68 [2023-11-24 23:16:12,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:12,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:12,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:12,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-24 23:16:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:16:12,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:16:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003470057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:16:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1506581296] [2023-11-24 23:16:13,102 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-24 23:16:13,102 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:16:13,107 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 23:16:13,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:16:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-24 23:16:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392019716] [2023-11-24 23:16:13,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:16:13,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-24 23:16:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:16:13,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-24 23:16:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-24 23:16:13,113 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 23:16:22,419 WARN L293 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 173 DAG size of output: 156 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 23:16:24,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 23:16:27,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 23:16:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:16:28,838 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-11-24 23:16:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:16:28,839 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2023-11-24 23:16:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:16:28,840 INFO L225 Difference]: With dead ends: 31 [2023-11-24 23:16:28,840 INFO L226 Difference]: Without dead ends: 22 [2023-11-24 23:16:28,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=73, Invalid=346, Unknown=1, NotChecked=0, Total=420 [2023-11-24 23:16:28,842 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:16:28,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 63 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2023-11-24 23:16:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-24 23:16:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-24 23:16:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-24 23:16:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-11-24 23:16:28,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2023-11-24 23:16:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:16:28,853 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-11-24 23:16:28,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 23:16:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-11-24 23:16:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 23:16:28,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:16:28,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:16:28,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:16:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:16:29,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:16:29,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:16:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1325948716, now seen corresponding path program 2 times [2023-11-24 23:16:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:16:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788382465] [2023-11-24 23:16:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:16:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:16:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:16:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-24 23:16:31,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:16:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788382465] [2023-11-24 23:16:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788382465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:16:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221385670] [2023-11-24 23:16:31,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 23:16:31,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:16:31,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:16:31,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:16:31,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_413abc47-1f29-4a22-aa31-d1cf8d704a25/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:16:32,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-24 23:16:32,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:16:32,305 WARN L260 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 166 conjunts are in the unsatisfiable core [2023-11-24 23:16:32,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:16:32,331 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:16:32,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-24 23:16:38,897 WARN L854 $PredicateComparison]: unable to prove that (and (<= 10000 (mod (select (select |c_#memory_int| |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296)) (let ((.cse108 (mod (select (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse111 (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse112 (* .cse108 4)) (.cse113 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~tmp.base|) |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) (let ((.cse32 (store .cse111 (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| .cse112) .cse113)) (.cse8 (store .cse111 (+ (- 17179869184) |c_func_to_recursive_line_38_to_41_0_#in~array.offset| .cse112) .cse113))) (let ((.cse14 (= |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse57 (let ((.cse110 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse8) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse110 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse110 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1)))) (.cse0 (<= 2147483648 .cse108)) (.cse46 (let ((.cse109 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse32) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse109 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse109 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1)))) (.cse7 (select |c_#memory_int| |c_func_to_recursive_line_38_to_41_0_#in~tmp.base|)) (.cse37 (<= .cse108 2147483647))) (or (and (= |c_func_to_recursive_line_38_to_41_0_#in~index.base| |c_func_to_recursive_line_38_to_41_0_#in~tmp.base|) (or (and .cse0 (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| v_DerPreprocessor_8) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_9))) (let ((.cse9 (select .cse13 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse10 (mod (select (select .cse13 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse11 (store .cse9 (+ (* 4 .cse10) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|) (select v_DerPreprocessor_9 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse4 (let ((.cse12 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_9) |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse11) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse12 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse12 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse6 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse11) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse4) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse5 (mod (select (select .cse6 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (= (store (let ((.cse1 (select .cse6 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse2 (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| (* .cse5 4)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse1 .cse2 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse3 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse4) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse1 .cse2 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse3 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse3 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|) (= .cse8 .cse9) (<= .cse5 9999) (= .cse9 v_DerPreprocessor_8) (<= .cse10 9999)))))))))) (and .cse14 (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse24 (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_7))) (let ((.cse15 (mod (select (select .cse24 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse22 (store (select .cse24 |c_func_to_recursive_line_38_to_41_0_#in~array.base|) (+ (* .cse15 4) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|) (select v_DerPreprocessor_7 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse20 (let ((.cse23 (select (store .cse24 |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse22) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse23 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse21 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse22) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse20) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse16 (mod (select (select .cse21 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (<= .cse15 9999) (<= .cse16 9999) (= (store (let ((.cse17 (select .cse21 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse18 (+ (* .cse16 4) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse17 .cse18 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse19 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse20) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse17 .cse18 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse19 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse19 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|)))))))))) (and (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse36 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| v_DerPreprocessor_8) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_9))) (let ((.cse31 (select .cse36 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse33 (mod (select (select .cse36 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse34 (store .cse31 (+ (* 4 .cse33) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|) (select v_DerPreprocessor_9 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse28 (let ((.cse35 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_9) |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse34) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse35 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse35 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse30 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse34) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse28) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse29 (mod (select (select .cse30 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (= (store (let ((.cse25 (select .cse30 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse26 (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| (* .cse29 4)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse25 .cse26 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse27 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse28) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse25 .cse26 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse27 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse27 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|) (<= .cse29 9999) (= .cse31 v_DerPreprocessor_8) (= .cse31 .cse32) (<= .cse33 9999))))))))) .cse37))) (and (or (and (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse49 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_10) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_11))) (let ((.cse44 (select .cse49 |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (let ((.cse45 (mod (select .cse44 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse47 (store (select .cse49 |c_func_to_recursive_line_38_to_41_0_#in~array.base|) (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| (* .cse45 4)) (select v_DerPreprocessor_11 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse41 (let ((.cse48 (select (store .cse49 |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse47) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse48 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse48 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse43 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse47) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse41) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse42 (mod (select (select .cse43 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (= (store (let ((.cse38 (select .cse43 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse39 (+ (* .cse42 4) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse38 .cse39 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse40 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse41) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse38 .cse39 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse40 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse40 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|) (= v_DerPreprocessor_10 .cse44) (<= .cse45 9999) (<= .cse42 9999) (= .cse44 .cse46)))))))))) .cse37) (and .cse0 (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse61 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_10) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_11))) (let ((.cse56 (select .cse61 |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (let ((.cse58 (mod (select .cse56 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse59 (store (select .cse61 |c_func_to_recursive_line_38_to_41_0_#in~array.base|) (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| (* .cse58 4)) (select v_DerPreprocessor_11 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse53 (let ((.cse60 (select (store .cse61 |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse59) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse60 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse60 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse55 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse59) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse53) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse54 (mod (select (select .cse55 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (= (store (let ((.cse50 (select .cse55 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse51 (+ (* .cse54 4) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse50 .cse51 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse52 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse53) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse50 .cse51 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse52 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse52 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|) (= .cse56 .cse57) (= v_DerPreprocessor_10 .cse56) (<= .cse58 9999) (<= .cse54 9999)))))))))))) (= |c_func_to_recursive_line_38_to_41_0_#in~index.base| |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (and .cse14 (or (and (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse72 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_12) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_13))) (let ((.cse62 (select .cse72 |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (let ((.cse69 (mod (select .cse62 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse70 (store (select .cse72 |c_func_to_recursive_line_38_to_41_0_#in~array.base|) (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| (* .cse69 4)) (select v_DerPreprocessor_13 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse67 (let ((.cse71 (select (store .cse72 |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse70) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse71 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse71 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse68 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse70) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse67) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse63 (mod (select (select .cse68 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (= .cse62 .cse57) (<= .cse63 9999) (= |c_#memory_int| (store (let ((.cse64 (select .cse68 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse65 (+ (* .cse63 4) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse64 .cse65 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse66 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse67) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse64 .cse65 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse66 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse66 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7)) (<= .cse69 9999) (= v_DerPreprocessor_12 .cse62)))))))))) .cse0) (and .cse37 (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse83 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_12) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_13))) (let ((.cse79 (select .cse83 |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (let ((.cse80 (mod (select .cse79 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse81 (store (select .cse83 |c_func_to_recursive_line_38_to_41_0_#in~array.base|) (+ |c_func_to_recursive_line_38_to_41_0_#in~array.offset| (* .cse80 4)) (select v_DerPreprocessor_13 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse77 (let ((.cse82 (select (store .cse83 |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse81) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse82 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse82 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse78 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse81) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse77) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse73 (mod (select (select .cse78 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (<= .cse73 9999) (= |c_#memory_int| (store (let ((.cse74 (select .cse78 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse75 (+ (* .cse73 4) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse74 .cse75 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse76 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse77) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse74 .cse75 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse76 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse76 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7)) (= .cse79 .cse46) (<= .cse80 9999) (= v_DerPreprocessor_12 .cse79))))))))))))) (and (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse95 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| v_DerPreprocessor_14) |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_15) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_16))) (let ((.cse86 (select .cse95 |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (let ((.cse92 (select .cse95 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse85 (mod (select .cse86 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse93 (store .cse92 (+ (* 4 .cse85) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|) (select v_DerPreprocessor_16 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse90 (let ((.cse94 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_15) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_16) |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse93) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse94 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse94 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse91 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse93) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse90) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse84 (mod (select (select .cse91 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (<= .cse84 9999) (<= .cse85 9999) (= .cse86 .cse57) (= v_DerPreprocessor_15 .cse86) (= (store (let ((.cse87 (select .cse91 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse88 (+ (* 4 .cse84) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse87 .cse88 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse89 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse90) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse87 .cse88 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse89 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse89 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|) (= .cse8 .cse92)))))))))) .cse0) (and (exists ((v_ArrVal_114 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse107 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| v_DerPreprocessor_14) |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_15) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_16))) (let ((.cse98 (select .cse107 |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (let ((.cse99 (select .cse107 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse97 (mod (select .cse98 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (let ((.cse105 (store .cse99 (+ (* 4 .cse97) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|) (select v_DerPreprocessor_16 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|)))) (let ((.cse103 (let ((.cse106 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| v_DerPreprocessor_15) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_16) |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse105) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse106 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse106 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) (let ((.cse104 (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| .cse105) |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse103) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6))) (let ((.cse96 (mod (select (select .cse104 |c_func_to_recursive_line_38_to_41_0_#in~index.base|) |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 4294967296))) (and (<= .cse96 9999) (<= .cse97 9999) (= v_DerPreprocessor_15 .cse98) (= .cse98 .cse46) (= .cse99 .cse32) (= .cse99 v_DerPreprocessor_14) (= (store (let ((.cse100 (select .cse104 |c_func_to_recursive_line_38_to_41_0_#in~array.base|)) (.cse101 (+ (* 4 .cse96) |c_func_to_recursive_line_38_to_41_0_#in~array.offset|))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse100 .cse101 v_ArrVal_114)) |c_func_to_recursive_line_38_to_41_0_#in~index.base| (let ((.cse102 (select (store (store (store |c_old(#memory_int)| |c_func_to_recursive_line_38_to_41_0_#in~index.base| .cse103) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| v_DerPreprocessor_6) |c_func_to_recursive_line_38_to_41_0_#in~array.base| (store .cse100 .cse101 (select v_DerPreprocessor_6 |c_func_to_recursive_line_38_to_41_0_#in~tmp.offset|))) |c_func_to_recursive_line_38_to_41_0_#in~index.base|))) (store .cse102 |c_func_to_recursive_line_38_to_41_0_#in~index.offset| (+ (select .cse102 |c_func_to_recursive_line_38_to_41_0_#in~index.offset|) 1))))) |c_func_to_recursive_line_38_to_41_0_#in~tmp.base| .cse7) |c_#memory_int|)))))))))) .cse37))))))) is different from false [2023-11-24 23:16:40,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:40,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:40,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:40,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2023-11-24 23:16:40,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:40,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 25 [2023-11-24 23:16:40,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:16:40,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 23:16:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2023-11-24 23:16:40,900 INFO L327 TraceCheckSpWp]: Computing backward predicates...