./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.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_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/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_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/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_f577540e-4aa0-4004-8b21-10daf9885f59/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 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:58:06,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:58:06,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-24 23:58:06,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:58:06,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:58:06,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:58:06,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:58:06,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:58:06,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:58:06,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:58:06,424 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:58:06,425 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:58:06,425 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:58:06,427 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:58:06,427 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:58:06,428 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:58:06,428 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:58:06,428 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:58:06,429 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:58:06,429 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:58:06,430 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:58:06,430 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:58:06,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:58:06,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:58:06,432 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:58:06,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:58:06,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:58:06,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:58:06,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:58:06,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:58:06,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:58:06,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:58:06,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:58:06,436 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:58:06,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:58:06,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:58:06,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:58:06,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:58:06,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:58:06,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:58:06,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:58:06,439 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:58:06,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:58:06,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:58:06,441 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:58:06,441 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:58:06,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:58:06,441 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_f577540e-4aa0-4004-8b21-10daf9885f59/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_f577540e-4aa0-4004-8b21-10daf9885f59/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 -> 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 [2023-11-24 23:58:06,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:58:06,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:58:06,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:58:06,810 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:58:06,811 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:58:06,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2023-11-24 23:58:09,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:58:10,096 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:58:10,097 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2023-11-24 23:58:10,106 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/data/06bad6859/eb84b170377b4d5aadd3be2a2e1e9847/FLAG8dd0292d3 [2023-11-24 23:58:10,121 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/data/06bad6859/eb84b170377b4d5aadd3be2a2e1e9847 [2023-11-24 23:58:10,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:58:10,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:58:10,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:58:10,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:58:10,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:58:10,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616a24a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10, skipping insertion in model container [2023-11-24 23:58:10,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:58:10,368 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_f577540e-4aa0-4004-8b21-10daf9885f59/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2023-11-24 23:58:10,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:58:10,428 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:58:10,446 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_f577540e-4aa0-4004-8b21-10daf9885f59/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2023-11-24 23:58:10,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:58:10,498 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:58:10,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10 WrapperNode [2023-11-24 23:58:10,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:58:10,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:58:10,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:58:10,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:58:10,509 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:58:10" (1/1) ... [2023-11-24 23:58:10,529 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:58:10" (1/1) ... [2023-11-24 23:58:10,554 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2023-11-24 23:58:10,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:58:10,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:58:10,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:58:10,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:58:10,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:58:10,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:58:10,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:58:10,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:58:10,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (1/1) ... [2023-11-24 23:58:10,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:58:10,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:10,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/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:58:10,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/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:58:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2023-11-24 23:58:10,708 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2023-11-24 23:58:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:58:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2023-11-24 23:58:10,708 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2023-11-24 23:58:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-24 23:58:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-24 23:58:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:58:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:58:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:58:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2023-11-24 23:58:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2023-11-24 23:58:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:58:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:58:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:58:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-24 23:58:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-24 23:58:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:58:10,803 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:58:10,806 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:58:11,118 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:58:11,192 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:58:11,192 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 23:58:11,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:58:11 BoogieIcfgContainer [2023-11-24 23:58:11,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:58:11,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:58:11,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:58:11,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:58:11,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:58:10" (1/3) ... [2023-11-24 23:58:11,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595f6c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:58:11, skipping insertion in model container [2023-11-24 23:58:11,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:58:10" (2/3) ... [2023-11-24 23:58:11,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595f6c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:58:11, skipping insertion in model container [2023-11-24 23:58:11,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:58:11" (3/3) ... [2023-11-24 23:58:11,208 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2023-11-24 23:58:11,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:58:11,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 23:58:11,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:58:11,287 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;@90537a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:58:11,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 23:58:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-24 23:58:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 23:58:11,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:11,301 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:11,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:58:11,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1538422702, now seen corresponding path program 1 times [2023-11-24 23:58:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:11,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178246223] [2023-11-24 23:58:11,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:11,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:58:12,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178246223] [2023-11-24 23:58:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178246223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:58:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 23:58:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851598714] [2023-11-24 23:58:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:12,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:58:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:12,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:58:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:58:12,199 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:58:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:12,485 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2023-11-24 23:58:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:58:12,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-11-24 23:58:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:12,497 INFO L225 Difference]: With dead ends: 83 [2023-11-24 23:58:12,498 INFO L226 Difference]: Without dead ends: 42 [2023-11-24 23:58:12,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:58:12,507 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:12,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:58:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-24 23:58:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-11-24 23:58:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-11-24 23:58:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-11-24 23:58:12,555 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 22 [2023-11-24 23:58:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:12,556 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-11-24 23:58:12,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:58:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-11-24 23:58:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 23:58:12,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:12,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:58:12,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:58:12,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:58:12,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1334543510, now seen corresponding path program 1 times [2023-11-24 23:58:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832756821] [2023-11-24 23:58:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:58:13,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832756821] [2023-11-24 23:58:13,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832756821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373459453] [2023-11-24 23:58:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:13,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:13,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:13,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:13,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:58:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:13,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-24 23:58:13,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:13,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:58:14,231 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-24 23:58:14,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 85 treesize of output 70 [2023-11-24 23:58:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 23:58:14,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 23:58:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373459453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:58:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 23:58:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2023-11-24 23:58:14,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105512692] [2023-11-24 23:58:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:58:14,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 23:58:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 23:58:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-11-24 23:58:14,378 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 23:58:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:14,693 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-11-24 23:58:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 23:58:14,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-11-24 23:58:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:14,696 INFO L225 Difference]: With dead ends: 57 [2023-11-24 23:58:14,696 INFO L226 Difference]: Without dead ends: 55 [2023-11-24 23:58:14,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2023-11-24 23:58:14,698 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:14,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 205 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:58:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-24 23:58:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-11-24 23:58:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 33 states have internal predecessors, (33), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-24 23:58:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-11-24 23:58:14,711 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 27 [2023-11-24 23:58:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:14,712 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-11-24 23:58:14,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 23:58:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-11-24 23:58:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:58:14,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:14,714 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-11-24 23:58:14,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-24 23:58:14,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:14,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:58:14,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -529808002, now seen corresponding path program 1 times [2023-11-24 23:58:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300910470] [2023-11-24 23:58:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:58:15,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300910470] [2023-11-24 23:58:15,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300910470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685005553] [2023-11-24 23:58:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:15,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:15,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:58:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:16,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-24 23:58:16,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:16,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-24 23:58:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 23:58:16,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685005553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1762217814] [2023-11-24 23:58:16,581 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-11-24 23:58:16,581 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:16,586 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:58:16,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:16,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-24 23:58:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769860796] [2023-11-24 23:58:16,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:16,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:58:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:58:16,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=169, Unknown=3, NotChecked=0, Total=210 [2023-11-24 23:58:16,591 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 14 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-24 23:58:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:17,358 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2023-11-24 23:58:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:58:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 34 [2023-11-24 23:58:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:17,362 INFO L225 Difference]: With dead ends: 95 [2023-11-24 23:58:17,362 INFO L226 Difference]: Without dead ends: 55 [2023-11-24 23:58:17,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=342, Unknown=3, NotChecked=0, Total=420 [2023-11-24 23:58:17,364 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:17,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:58:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-24 23:58:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-24 23:58:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-24 23:58:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-11-24 23:58:17,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2023-11-24 23:58:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:17,393 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-11-24 23:58:17,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-24 23:58:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-11-24 23:58:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-24 23:58:17,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:17,401 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2023-11-24 23:58:17,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:58:17,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:17,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:58:17,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1978497932, now seen corresponding path program 2 times [2023-11-24 23:58:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904496498] [2023-11-24 23:58:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 23:58:19,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904496498] [2023-11-24 23:58:19,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904496498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664526791] [2023-11-24 23:58:19,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 23:58:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:19,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:19,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:19,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:58:19,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-24 23:58:19,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:58:19,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-24 23:58:19,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:19,910 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 23:58:19,910 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 39 treesize of output 35 [2023-11-24 23:58:20,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-24 23:58:20,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 23:58:20,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2023-11-24 23:58:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-24 23:58:20,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664526791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968074999] [2023-11-24 23:58:20,835 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-11-24 23:58:20,835 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:20,836 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:58:20,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-11-24 23:58:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555549619] [2023-11-24 23:58:20,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:20,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-24 23:58:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-24 23:58:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=599, Unknown=13, NotChecked=0, Total=702 [2023-11-24 23:58:20,841 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 22 states have internal predecessors, (43), 10 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-24 23:58:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:58:21,856 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2023-11-24 23:58:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 23:58:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 22 states have internal predecessors, (43), 10 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 44 [2023-11-24 23:58:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:58:21,858 INFO L225 Difference]: With dead ends: 110 [2023-11-24 23:58:21,858 INFO L226 Difference]: Without dead ends: 62 [2023-11-24 23:58:21,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=1192, Unknown=14, NotChecked=0, Total=1406 [2023-11-24 23:58:21,861 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 37 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:58:21,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 111 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 481 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 23:58:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-24 23:58:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-11-24 23:58:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-24 23:58:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-11-24 23:58:21,874 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 44 [2023-11-24 23:58:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:58:21,874 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-11-24 23:58:21,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 22 states have internal predecessors, (43), 10 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-24 23:58:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-11-24 23:58:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-24 23:58:21,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:58:21,877 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 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] [2023-11-24 23:58:21,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-24 23:58:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:22,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 23:58:22,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:58:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash -266205468, now seen corresponding path program 1 times [2023-11-24 23:58:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:58:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082146214] [2023-11-24 23:58:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:58:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-24 23:58:24,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:58:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082146214] [2023-11-24 23:58:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082146214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673978943] [2023-11-24 23:58:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:58:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:58:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:58:24,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:58:24,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f577540e-4aa0-4004-8b21-10daf9885f59/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:58:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:58:25,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-24 23:58:25,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:58:25,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-24 23:58:32,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|))) (and (let ((.cse35 (select |c_#memory_int| |c_func_to_recursive_line_40_to_41_0_#in~array.base|)) (.cse57 (mod (select (select |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 4294967296))) (let ((.cse10 (<= .cse57 2147483647)) (.cse0 (<= 2147483648 .cse57)) (.cse34 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse35)) (.cse8 (select |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base|)) (.cse9 (* .cse57 4))) (or (and (= |c_func_to_recursive_line_40_to_41_0_#in~array.base| |c_func_to_recursive_line_40_to_41_0_#in~i.base|) (or (and .cse0 (exists ((v_prenex_25 Int) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_25| Int) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse6 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse7 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store .cse8 (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset .cse9) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_25|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse7 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse7 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse5 (+ (select .cse6 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse3 (store .cse6 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5))) (let ((.cse1 (mod .cse5 4294967296)) (.cse2 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse3))) (and (<= .cse1 2147483647) (= (+ (select (select (store .cse2 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse3) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ v_prenex_25 (* .cse1 4)) v_prenex_24)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse4) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse2 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_22) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4)) |c_#memory_int|)))))))) (and .cse10 (exists ((v_prenex_26 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse15 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse16 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store .cse8 (+ v_prenex_21 .cse9) v_prenex_20)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse16 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse16 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse14 (+ (select .cse15 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse13 (store .cse15 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse14))) (let ((.cse11 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse13)) (.cse12 (mod .cse14 4294967296))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse11 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_259) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4))) (<= 2147483648 .cse12) (= (+ (select (select (store .cse11 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse13) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) (* 4 .cse12) v_prenex_26) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse4)))))))) (and .cse0 (exists ((v_prenex_26 Int) (v_ArrVal_259 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_25| Int) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse21 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse22 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store .cse8 (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset .cse9) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_25|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse22 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse22 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse20 (+ (select .cse21 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse18 (store .cse21 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse20))) (let ((.cse19 (mod .cse20 4294967296)) (.cse17 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse18))) (and (= (+ 1 (select (select (store .cse17 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse18) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) (* .cse19 4) v_prenex_26) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|)) .cse4) (<= 2147483648 .cse19) (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse17 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_259) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4)))))))))) (and (exists ((v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_23 (Array Int Int)) (v_prenex_20 Int) (v_prenex_22 (Array Int Int))) (let ((.cse27 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse28 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store .cse8 (+ v_prenex_21 .cse9) v_prenex_20)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse28 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse28 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse26 (+ (select .cse27 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse25 (store .cse27 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse26))) (let ((.cse24 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse25)) (.cse23 (mod .cse26 4294967296))) (and (<= .cse23 2147483647) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse24 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_22) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4)) |c_#memory_int|) (= (+ (select (select (store .cse24 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse25) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* .cse23 4) v_prenex_25) v_prenex_24)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse4))))))) .cse10))) (and (exists ((v_prenex_37 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse39 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse38 (+ (select .cse39 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse32 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_DerPreprocessor_6) |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|)) (.cse30 (store .cse39 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse38))) (let ((.cse31 (mod .cse38 4294967296)) (.cse29 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse30)) (.cse33 (let ((.cse37 (+ v_prenex_37 .cse9))) (store .cse8 .cse37 (select .cse32 .cse37))))) (and (= (+ (select (select (store .cse29 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse30) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset (* .cse31 4)) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse4) (<= 2147483648 .cse31) (= .cse32 .cse33) (= (store .cse34 |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse29 |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse35) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4)) |c_#memory_int|) (= v_DerPreprocessor_7 (let ((.cse36 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse33) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse36 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse36 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))))))))) .cse10) (and (exists ((v_prenex_37 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse48 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_27) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse46 (+ (select .cse48 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse41 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_DerPreprocessor_6) |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|)) (.cse43 (store .cse48 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse46))) (let ((.cse40 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse43)) (.cse42 (let ((.cse47 (+ v_prenex_37 .cse9))) (store .cse8 .cse47 (select .cse41 .cse47)))) (.cse44 (mod .cse46 4294967296))) (and (= |c_#memory_int| (store .cse34 |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse40 |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse35) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4))) (= .cse41 .cse42) (= (+ (select (select (store .cse40 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_27) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse43) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* .cse44 4) v_prenex_29) v_prenex_28)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse4) (= v_DerPreprocessor_7 (let ((.cse45 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse42) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse45 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse45 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) (<= .cse44 2147483647))))))) .cse10) (and .cse0 (exists ((v_prenex_38 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse56 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse51 (+ (select .cse56 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse50 (store .cse56 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse51)) (.cse54 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_DerPreprocessor_6) |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|))) (let ((.cse53 (let ((.cse55 (+ (- 17179869184) v_prenex_38 .cse9))) (store .cse8 .cse55 (select .cse54 .cse55)))) (.cse49 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse50))) (and (= (+ (select (select (store .cse49 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse50) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset (* (mod .cse51 4294967296) 4)) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse4) (= (let ((.cse52 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse53) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse52 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse52 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) v_DerPreprocessor_7) (= .cse53 .cse54) (= (store .cse34 |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse49 |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse35) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse4)) |c_#memory_int|))))))))))) (<= 100000 (mod .cse4 4294967296)))) is different from false [2023-11-24 23:58:35,659 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|))) (and (let ((.cse9 (select |c_#memory_int| |c_func_to_recursive_line_40_to_41_0_#in~array.base|))) (let ((.cse8 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse9))) (or (exists ((v_ArrVal_250 (Array Int Int))) (let ((.cse10 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse14 (select .cse10 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse15 (+ (select .cse14 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse12 (mod .cse15 4294967296))) (and (exists ((v_prenex_37 Int) (v_subst_3 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse16 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_3) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse13 (+ (select .cse16 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse3 (store .cse16 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse13)) (.cse7 (store .cse14 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse15)) (.cse1 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_DerPreprocessor_6) |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|))) (let ((.cse4 (mod .cse13 4294967296)) (.cse0 (let ((.cse11 (+ v_prenex_37 (* .cse12 4)))) (store (select (store .cse10 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) .cse11 (select .cse1 .cse11)))) (.cse2 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse3))) (and (= .cse0 .cse1) (= (+ (select (select (store .cse2 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_3) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse3) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset (* .cse4 4)) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5) (<= 2147483648 .cse4) (= (let ((.cse6 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse0) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse6 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse6 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) v_DerPreprocessor_7) (= (store .cse8 |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse2 |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse9) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5)) |c_#memory_int|))))))) (<= .cse12 2147483647))))))) (exists ((v_ArrVal_250 (Array Int Int))) (let ((.cse25 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse28 (select .cse25 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse29 (+ (select .cse28 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse17 (mod .cse29 4294967296))) (and (<= 2147483648 .cse17) (exists ((v_prenex_38 Int) (v_subst_4 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse27 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_4) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse20 (+ (select .cse27 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse22 (store .cse28 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse29)) (.cse24 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_DerPreprocessor_6) |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|)) (.cse19 (store .cse27 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse20))) (let ((.cse18 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse19)) (.cse23 (let ((.cse26 (+ (- 17179869184) v_prenex_38 (* .cse17 4)))) (store (select (store .cse25 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse22) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) .cse26 (select .cse24 .cse26))))) (and (= (+ (select (select (store .cse18 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_4) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse19) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* (mod .cse20 4294967296) 4) (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5) (= |c_#memory_int| (store .cse8 |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse18 |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse9) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5))) (= (let ((.cse21 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse22) |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse23) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse21 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse21 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) v_DerPreprocessor_7) (= .cse24 .cse23))))))))))))) (and (= |c_func_to_recursive_line_40_to_41_0_#in~array.base| |c_func_to_recursive_line_40_to_41_0_#in~i.base|) (or (exists ((v_ArrVal_250 (Array Int Int)) (v_prenex_25 Int) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_25| Int) (v_prenex_24 Int) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse38 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse39 (select .cse38 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse40 (+ (select .cse39 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse31 (mod .cse40 4294967296))) (let ((.cse35 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse36 (select (let ((.cse37 (store .cse39 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse40))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse37) |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store .cse38 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse37) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset (* .cse31 4)) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_25|))) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse36 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse36 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse34 (+ (select .cse35 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse33 (store .cse35 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse34))) (let ((.cse32 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse33)) (.cse30 (mod .cse34 4294967296))) (and (<= .cse30 2147483647) (<= 2147483648 .cse31) (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse32 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_22) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5))) (= (+ (select (select (store .cse32 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse33) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* .cse30 4) v_prenex_25) v_prenex_24)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5))))))))))) (exists ((v_prenex_26 Int) (v_ArrVal_259 (Array Int Int)) (v_subst_1 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_25| Int) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (func_to_recursive_line_40_to_41_0_~array.offset Int)) (let ((.cse49 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse50 (select .cse49 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse51 (+ (select .cse50 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse41 (mod .cse51 4294967296))) (let ((.cse46 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse47 (select (let ((.cse48 (store .cse50 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse51))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse48) |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store .cse49 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse48) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) func_to_recursive_line_40_to_41_0_~array.offset (* .cse41 4)) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_25|))) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse47 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse47 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_1) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse45 (+ (select .cse46 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse43 (store .cse46 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse45))) (let ((.cse42 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse43)) (.cse44 (mod .cse45 4294967296))) (and (<= 2147483648 .cse41) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse42 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_259) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5)) |c_#memory_int|) (= (+ (select (select (store .cse42 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_1) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse43) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (- 17179869184) v_prenex_26 (* .cse44 4)) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5) (<= 2147483648 .cse44))))))))))) (exists ((v_prenex_26 Int) (v_ArrVal_259 (Array Int Int)) (v_subst_2 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (|v_func_to_recursive_line_40_to_41_0_#t~nondet26_26| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse60 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse61 (select .cse60 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse62 (+ (select .cse61 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse55 (mod .cse62 4294967296))) (let ((.cse57 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse58 (select (let ((.cse59 (store .cse61 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse62))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse59) |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store .cse60 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse59) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ v_prenex_21 (* .cse55 4)) v_prenex_20))) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse58 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse58 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_2) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse56 (+ (select .cse57 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse53 (store .cse57 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse56))) (let ((.cse54 (mod .cse56 4294967296)) (.cse52 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse53))) (and (= (+ (select (select (store .cse52 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_subst_2) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse53) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* .cse54 4) (- 17179869184) v_prenex_26) |v_func_to_recursive_line_40_to_41_0_#t~nondet26_26|)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5) (<= 2147483648 .cse54) (<= .cse55 2147483647) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse52 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_259) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5)) |c_#memory_int|))))))))))) (exists ((v_ArrVal_250 (Array Int Int)) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_23 (Array Int Int)) (v_prenex_20 Int) (v_prenex_22 (Array Int Int))) (let ((.cse71 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse72 (select .cse71 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse73 (+ (select .cse72 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse64 (mod .cse73 4294967296))) (let ((.cse68 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (let ((.cse69 (select (let ((.cse70 (store .cse72 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse73))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse70) |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store .cse71 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse70) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ v_prenex_21 (* .cse64 4)) v_prenex_20))) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse69 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse69 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1)))) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse67 (+ (select .cse68 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse65 (store .cse68 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse67))) (let ((.cse63 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse65)) (.cse66 (mod .cse67 4294967296))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse63 |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_22) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5)) |c_#memory_int|) (<= .cse64 2147483647) (= (+ (select (select (store .cse63 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_23) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse65) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* .cse66 4) v_prenex_25) v_prenex_24)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5) (<= .cse66 2147483647))))))))))))) (exists ((v_ArrVal_250 (Array Int Int))) (let ((.cse82 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_ArrVal_250))) (let ((.cse86 (select .cse82 |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse87 (+ (select .cse86 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse84 (mod .cse87 4294967296))) (and (exists ((v_prenex_37 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse85 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_27) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (let ((.cse81 (+ (select .cse85 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) (let ((.cse80 (store .cse86 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse87)) (.cse75 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_DerPreprocessor_6) |c_func_to_recursive_line_40_to_41_0_#in~i.base| v_DerPreprocessor_7) |c_func_to_recursive_line_40_to_41_0_#in~array.base|)) (.cse77 (store .cse85 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse81))) (let ((.cse76 (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse77)) (.cse74 (let ((.cse83 (+ v_prenex_37 (* .cse84 4)))) (store (select (store .cse82 |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse80) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) .cse83 (select .cse75 .cse83)))) (.cse78 (mod .cse81 4294967296))) (and (= .cse74 .cse75) (= |c_#memory_int| (store .cse8 |c_func_to_recursive_line_40_to_41_0_#in~i.base| (store (select (store .cse76 |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse9) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset| .cse5))) (= (+ (select (select (store .cse76 |c_func_to_recursive_line_40_to_41_0_#in~array.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~array.base| v_prenex_27) |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse77) |c_func_to_recursive_line_40_to_41_0_#in~array.base|) (+ (* .cse78 4) v_prenex_29) v_prenex_28)) |c_func_to_recursive_line_40_to_41_0_#in~i.base|) |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1) .cse5) (= (let ((.cse79 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_40_to_41_0_#in~i.base| .cse80) |c_func_to_recursive_line_40_to_41_0_#in~array.base| .cse74) |c_func_to_recursive_line_40_to_41_0_#in~i.base|))) (store .cse79 |c_func_to_recursive_line_40_to_41_0_#in~i.offset| (+ (select .cse79 |c_func_to_recursive_line_40_to_41_0_#in~i.offset|) 1))) v_DerPreprocessor_7) (<= .cse78 2147483647))))))) (<= .cse84 2147483647)))))))))) (<= 100000 (mod .cse5 4294967296)))) is different from false [2023-11-24 23:58:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 14 not checked. [2023-11-24 23:58:36,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:58:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673978943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:58:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1286339052] [2023-11-24 23:58:53,312 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-11-24 23:58:53,312 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:58:53,313 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:58:53,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:58:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2023-11-24 23:58:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135717057] [2023-11-24 23:58:53,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:58:53,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 23:58:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:58:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 23:58:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=474, Unknown=7, NotChecked=90, Total=650 [2023-11-24 23:58:53,316 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 25 states, 17 states have (on average 2.411764705882353) internal successors, (41), 24 states have internal predecessors, (41), 9 states have call successors, (18), 3 states have call predecessors, (18), 12 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18)