./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E --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 a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:58:06,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:58:06,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 02:58:06,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:58:06,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:58:06,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:58:06,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:58:06,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:58:06,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:58:06,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:58:06,437 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:58:06,437 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:58:06,437 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:58:06,437 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:58:06,437 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:58:06,438 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:58:06,439 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:58:06,439 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:58:06,439 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:58:06,439 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:58:06,439 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:58:06,439 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:58:06,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:58:06,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:58:06,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:58:06,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:58:06,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:58:06,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:58:06,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:58:06,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:58:06,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:58:06,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:58:06,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:58:06,443 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E 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 -> a7651578256dc791e0a036690d99e12094845a58f582fb99f9abee48c7c5dfba [2024-11-14 02:58:06,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:58:06,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:58:06,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:58:06,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:58:06,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:58:06,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i Unable to find full path for "g++" [2024-11-14 02:58:08,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:58:09,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:58:09,034 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2024-11-14 02:58:09,050 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/data/b46aebd96/7baa5c3ded904f578d7d871fdf1872c6/FLAG60793ab55 [2024-11-14 02:58:09,068 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/data/b46aebd96/7baa5c3ded904f578d7d871fdf1872c6 [2024-11-14 02:58:09,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:58:09,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:58:09,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:58:09,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:58:09,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:58:09,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397058b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09, skipping insertion in model container [2024-11-14 02:58:09,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:58:09,508 WARN L250 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22251,22264] [2024-11-14 02:58:09,512 WARN L250 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22336,22349] [2024-11-14 02:58:09,522 WARN L250 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22829,22842] [2024-11-14 02:58:09,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:58:09,535 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:58:09,586 WARN L250 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22251,22264] [2024-11-14 02:58:09,589 WARN L250 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22336,22349] [2024-11-14 02:58:09,596 WARN L250 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_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/sv-benchmarks/c/forester-heap/sll-reverse_simple.i[22829,22842] [2024-11-14 02:58:09,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:58:09,627 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:58:09,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09 WrapperNode [2024-11-14 02:58:09,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:58:09,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:58:09,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:58:09,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:58:09,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,664 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2024-11-14 02:58:09,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:58:09,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:58:09,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:58:09,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:58:09,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:58:09,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:58:09,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:58:09,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:58:09,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (1/1) ... [2024-11-14 02:58:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:58:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:09,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:58:09,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:58:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:58:09,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:58:09,872 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:58:09,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:58:10,155 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-14 02:58:10,155 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:58:10,282 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:58:10,282 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-14 02:58:10,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:58:10 BoogieIcfgContainer [2024-11-14 02:58:10,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:58:10,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:58:10,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:58:10,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:58:10,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:58:09" (1/3) ... [2024-11-14 02:58:10,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791681f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:58:10, skipping insertion in model container [2024-11-14 02:58:10,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:58:09" (2/3) ... [2024-11-14 02:58:10,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791681f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:58:10, skipping insertion in model container [2024-11-14 02:58:10,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:58:10" (3/3) ... [2024-11-14 02:58:10,296 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2024-11-14 02:58:10,318 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:58:10,321 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-reverse_simple.i that has 1 procedures, 25 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2024-11-14 02:58:10,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:58:10,403 INFO L333 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, 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;@13401209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:58:10,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 02:58:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 02:58:10,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:10,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 02:58:10,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:10,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 899412509, now seen corresponding path program 1 times [2024-11-14 02:58:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:10,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673377585] [2024-11-14 02:58:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:10,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673377585] [2024-11-14 02:58:10,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673377585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:58:10,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:58:10,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:58:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900663076] [2024-11-14 02:58:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:58:10,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 02:58:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 02:58:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:58:10,683 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:10,747 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2024-11-14 02:58:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 02:58:10,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 02:58:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:10,758 INFO L225 Difference]: With dead ends: 47 [2024-11-14 02:58:10,758 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 02:58:10,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:58:10,764 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:10,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 02:58:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 02:58:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-14 02:58:10,795 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2024-11-14 02:58:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:10,795 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-14 02:58:10,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-14 02:58:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 02:58:10,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:10,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:10,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:58:10,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1072454639, now seen corresponding path program 1 times [2024-11-14 02:58:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237570537] [2024-11-14 02:58:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:10,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237570537] [2024-11-14 02:58:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237570537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:58:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:58:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:58:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825719116] [2024-11-14 02:58:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:58:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:58:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:58:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:58:10,981 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:11,138 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-14 02:58:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:58:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 02:58:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:11,139 INFO L225 Difference]: With dead ends: 42 [2024-11-14 02:58:11,139 INFO L226 Difference]: Without dead ends: 32 [2024-11-14 02:58:11,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:58:11,140 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:11,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:58:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-14 02:58:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-14 02:58:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-14 02:58:11,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2024-11-14 02:58:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:11,152 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-14 02:58:11,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-14 02:58:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 02:58:11,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:11,154 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:11,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 02:58:11,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:11,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2094606155, now seen corresponding path program 1 times [2024-11-14 02:58:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283531300] [2024-11-14 02:58:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:11,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283531300] [2024-11-14 02:58:11,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283531300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:58:11,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:58:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:58:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914024053] [2024-11-14 02:58:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:58:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:58:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:11,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:58:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:58:11,578 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:11,807 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-14 02:58:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:58:11,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 02:58:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:11,810 INFO L225 Difference]: With dead ends: 57 [2024-11-14 02:58:11,810 INFO L226 Difference]: Without dead ends: 36 [2024-11-14 02:58:11,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:58:11,812 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:11,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:58:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-14 02:58:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-14 02:58:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-14 02:58:11,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2024-11-14 02:58:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:11,821 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-14 02:58:11,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-14 02:58:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 02:58:11,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:11,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:11,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 02:58:11,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1237650502, now seen corresponding path program 1 times [2024-11-14 02:58:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928748084] [2024-11-14 02:58:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:12,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928748084] [2024-11-14 02:58:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928748084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778307451] [2024-11-14 02:58:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:12,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:12,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:12,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:12,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:58:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:12,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 02:58:12,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:12,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 02:58:12,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 02:58:12,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 02:58:13,515 INFO L349 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2024-11-14 02:58:13,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 193 [2024-11-14 02:58:13,585 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 02:58:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 161 [2024-11-14 02:58:13,677 INFO L349 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2024-11-14 02:58:13,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 172 [2024-11-14 02:58:13,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 02:58:13,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 02:58:13,865 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 02:58:13,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 02:58:13,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:13,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 62 [2024-11-14 02:58:13,937 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-11-14 02:58:13,937 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 1 case distinctions, treesize of input 36 treesize of output 7 [2024-11-14 02:58:13,959 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 02:58:13,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2024-11-14 02:58:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 3 [2024-11-14 02:58:14,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-11-14 02:58:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:14,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:14,309 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2024-11-14 02:58:14,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 197 [2024-11-14 02:58:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778307451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:15,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1245330866] [2024-11-14 02:58:15,316 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 02:58:15,317 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:15,320 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:58:15,324 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:58:15,325 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:58:20,351 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:58:21,320 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '448#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-14 02:58:21,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:58:21,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-14 02:58:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001160502] [2024-11-14 02:58:21,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:21,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 02:58:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:21,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 02:58:21,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=228, Unknown=1, NotChecked=0, Total=306 [2024-11-14 02:58:21,323 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:22,813 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-14 02:58:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:58:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 02:58:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:22,817 INFO L225 Difference]: With dead ends: 69 [2024-11-14 02:58:22,817 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 02:58:22,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=116, Invalid=345, Unknown=1, NotChecked=0, Total=462 [2024-11-14 02:58:22,818 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:22,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 106 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 02:58:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 02:58:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2024-11-14 02:58:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-14 02:58:22,834 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 14 [2024-11-14 02:58:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:22,834 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-14 02:58:22,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-14 02:58:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 02:58:22,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:22,835 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:22,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:58:23,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-14 02:58:23,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:23,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash -357474877, now seen corresponding path program 2 times [2024-11-14 02:58:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:23,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231511466] [2024-11-14 02:58:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:24,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231511466] [2024-11-14 02:58:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231511466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945581774] [2024-11-14 02:58:24,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:58:24,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:24,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:24,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:58:24,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 02:58:24,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:24,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 02:58:24,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:24,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 02:58:24,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 02:58:24,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 02:58:24,914 INFO L349 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2024-11-14 02:58:24,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 201 [2024-11-14 02:58:24,973 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 02:58:24,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 196 [2024-11-14 02:58:25,048 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-14 02:58:25,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 209 [2024-11-14 02:58:25,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 02:58:25,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 02:58:25,204 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2024-11-14 02:58:25,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2024-11-14 02:58:25,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2024-11-14 02:58:25,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-14 02:58:25,401 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 02:58:25,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 02:58:25,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-11-14 02:58:25,533 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 23 treesize of output 11 [2024-11-14 02:58:25,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:58:25,584 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 20 treesize of output 15 [2024-11-14 02:58:25,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2024-11-14 02:58:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:25,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:25,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~prev~0#1.base|) (+ |c_ULTIMATE.start_main_~prev~0#1.offset| 4)) 1)) is different from false [2024-11-14 02:58:25,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_286 Int) (v_ArrVal_289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_286)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_289) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 1)) is different from false [2024-11-14 02:58:25,874 INFO L349 Elim1Store]: treesize reduction 10, result has 76.2 percent of original size [2024-11-14 02:58:25,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 178 treesize of output 205 [2024-11-14 02:58:25,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:58:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 02:58:26,187 INFO L349 Elim1Store]: treesize reduction 35, result has 53.3 percent of original size [2024-11-14 02:58:26,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 158 [2024-11-14 02:58:26,347 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 8 treesize of output 4 [2024-11-14 02:58:26,541 INFO L349 Elim1Store]: treesize reduction 51, result has 13.6 percent of original size [2024-11-14 02:58:26,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 23 [2024-11-14 02:58:26,556 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 8 treesize of output 4 [2024-11-14 02:58:26,708 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-14 02:58:26,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 240 treesize of output 259 [2024-11-14 02:58:26,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:58:26,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 83 [2024-11-14 02:58:26,785 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 15 treesize of output 11 [2024-11-14 02:58:26,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 1 [2024-11-14 02:58:26,978 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 7 treesize of output 3 [2024-11-14 02:58:27,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:58:27,001 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 125 treesize of output 125 [2024-11-14 02:58:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 02:58:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945581774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995381554] [2024-11-14 02:58:27,522 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 02:58:27,522 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:27,522 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:58:27,522 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:58:27,522 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:58:31,765 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:58:32,807 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '721#(and (<= 1 |#StackHeapBarrier|) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-14 02:58:32,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:58:32,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:32,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-14 02:58:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705997847] [2024-11-14 02:58:32,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:32,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 02:58:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 02:58:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=507, Unknown=2, NotChecked=94, Total=702 [2024-11-14 02:58:32,810 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:33,315 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-14 02:58:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:58:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 02:58:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:33,316 INFO L225 Difference]: With dead ends: 54 [2024-11-14 02:58:33,316 INFO L226 Difference]: Without dead ends: 52 [2024-11-14 02:58:33,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=551, Unknown=2, NotChecked=98, Total=756 [2024-11-14 02:58:33,318 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:33,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 175 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 62 Unchecked, 0.4s Time] [2024-11-14 02:58:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-14 02:58:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-14 02:58:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-14 02:58:33,339 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 15 [2024-11-14 02:58:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:33,340 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-14 02:58:33,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-14 02:58:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 02:58:33,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:33,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:33,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 02:58:33,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:33,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:33,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash -210149190, now seen corresponding path program 1 times [2024-11-14 02:58:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:33,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289490902] [2024-11-14 02:58:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:58:33,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:33,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289490902] [2024-11-14 02:58:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289490902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:33,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412817231] [2024-11-14 02:58:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:33,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:33,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:33,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 02:58:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:33,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 02:58:33,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:33,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 02:58:33,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 [2024-11-14 02:58:33,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:58:33,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 02:58:33,888 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 02:58:33,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 02:58:33,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-11-14 02:58:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:33,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:58:34,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:58:34,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-14 02:58:34,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:58:34,066 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 50 treesize of output 41 [2024-11-14 02:58:34,071 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 20 treesize of output 18 [2024-11-14 02:58:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412817231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:58:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1399807099] [2024-11-14 02:58:34,172 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 02:58:34,172 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:58:34,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:58:34,173 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:58:34,173 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:58:38,666 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:58:39,479 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '978#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~short7#1_20| Bool) (|v_ULTIMATE.start_main_#t~nondet6#1_17| Int)) (and (or (and (not |v_ULTIMATE.start_main_#t~short7#1_20|) (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short7#1_20|)) (or (not |v_ULTIMATE.start_main_#t~short7#1_20|) (= |v_ULTIMATE.start_main_#t~nondet6#1_17| 0)))))' at error location [2024-11-14 02:58:39,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:58:39,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:58:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-14 02:58:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370625229] [2024-11-14 02:58:39,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:58:39,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 02:58:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:58:39,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 02:58:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-14 02:58:39,481 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:58:40,423 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-11-14 02:58:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 02:58:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 02:58:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:58:40,424 INFO L225 Difference]: With dead ends: 69 [2024-11-14 02:58:40,424 INFO L226 Difference]: Without dead ends: 65 [2024-11-14 02:58:40,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2024-11-14 02:58:40,425 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 94 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:58:40,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 55 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 02:58:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-14 02:58:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2024-11-14 02:58:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-14 02:58:40,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 15 [2024-11-14 02:58:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:58:40,437 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-14 02:58:40,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:58:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-14 02:58:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 02:58:40,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:58:40,438 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:58:40,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 02:58:40,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 02:58:40,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:58:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:58:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1733245926, now seen corresponding path program 3 times [2024-11-14 02:58:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:58:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079088380] [2024-11-14 02:58:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:58:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:58:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:58:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:58:41,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:58:41,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079088380] [2024-11-14 02:58:41,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079088380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:58:41,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590609395] [2024-11-14 02:58:41,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:58:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:58:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:58:41,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:58:41,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 02:58:42,652 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:58:42,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:58:42,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 02:58:42,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:58:42,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 02:58:42,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-14 02:58:42,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 02:58:43,136 INFO L349 Elim1Store]: treesize reduction 92, result has 27.6 percent of original size [2024-11-14 02:58:43,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 232 treesize of output 300 [2024-11-14 02:58:43,406 INFO L349 Elim1Store]: treesize reduction 92, result has 27.6 percent of original size [2024-11-14 02:58:43,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 212 treesize of output 280 [2024-11-14 02:58:43,562 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 02:58:43,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 216 [2024-11-14 02:58:43,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 02:58:43,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 02:58:43,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:43,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 02:58:43,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:43,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 02:58:44,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 02:58:44,601 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-14 02:58:44,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 24 [2024-11-14 02:58:44,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 14 treesize of output 11 [2024-11-14 02:58:44,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2024-11-14 02:58:44,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2024-11-14 02:58:46,309 INFO L349 Elim1Store]: treesize reduction 218, result has 25.9 percent of original size [2024-11-14 02:58:46,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 2453 treesize of output 2193 [2024-11-14 02:58:46,569 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-14 02:58:46,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1760 treesize of output 1633 [2024-11-14 02:58:46,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1522 treesize of output 1535 [2024-11-14 02:58:46,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1498 treesize of output 1494 [2024-11-14 02:58:47,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1486 treesize of output 1487 [2024-11-14 02:58:47,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1481 treesize of output 1499 [2024-11-14 02:58:47,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1464 treesize of output 1469 [2024-11-14 02:58:47,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1452 treesize of output 1448 [2024-11-14 02:58:47,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1440 treesize of output 1441 [2024-11-14 02:58:47,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1404 treesize of output 1409 [2024-11-14 02:58:47,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1392 treesize of output 1397 [2024-11-14 02:58:48,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1380 treesize of output 1376 [2024-11-14 02:58:48,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1339 treesize of output 1344 [2024-11-14 02:58:48,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1327 treesize of output 1332 [2024-11-14 02:58:48,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1315 treesize of output 1311 [2024-11-14 02:58:48,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1303 treesize of output 1316 [2024-11-14 02:58:48,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1279 treesize of output 1284 [2024-11-14 02:58:48,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1267 treesize of output 1268 [2024-11-14 02:58:48,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1262 treesize of output 1263 [2024-11-14 02:58:49,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1257 treesize of output 1262 [2024-11-14 02:58:49,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 1245 treesize of output 1250 [2024-11-14 02:58:49,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1233 treesize of output 1251 [2024-11-14 02:58:50,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-14 02:58:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-14 02:58:50,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2024-11-14 02:58:50,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 83 [2024-11-14 02:58:50,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2024-11-14 02:58:52,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:52,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:58:52,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 02:58:52,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-14 02:58:52,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:58:52,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:52,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,929 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 527 [2024-11-14 02:58:53,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:53,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:53,253 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 7 treesize of output 5 [2024-11-14 02:58:53,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:53,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:53,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:53,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:53,969 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 7 treesize of output 5 [2024-11-14 02:58:54,026 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 7 treesize of output 5 [2024-11-14 02:58:54,077 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 7 treesize of output 5 [2024-11-14 02:58:54,147 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 7 treesize of output 5 [2024-11-14 02:58:54,235 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 7 treesize of output 5 [2024-11-14 02:58:54,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:54,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:54,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:54,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:54,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2024-11-14 02:58:54,654 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 189 treesize of output 149 [2024-11-14 02:58:54,686 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 182 treesize of output 144 [2024-11-14 02:58:54,696 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 175 treesize of output 139 [2024-11-14 02:58:54,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:54,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:54,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:54,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:54,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:54,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:54,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 41 treesize of output 26 [2024-11-14 02:58:54,744 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 5 treesize of output 3 [2024-11-14 02:58:54,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:54,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:54,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:54,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:54,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:54,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:54,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:54,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 609 [2024-11-14 02:58:54,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:55,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:55,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:58:55,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 02:58:55,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:55,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-14 02:58:55,219 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:55,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:58:55,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:55,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:55,527 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 7 treesize of output 5 [2024-11-14 02:58:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,378 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 7 treesize of output 5 [2024-11-14 02:58:56,417 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 7 treesize of output 5 [2024-11-14 02:58:56,481 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 7 treesize of output 5 [2024-11-14 02:58:56,536 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 7 treesize of output 5 [2024-11-14 02:58:56,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:56,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:57,050 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 941 treesize of output 765 [2024-11-14 02:58:57,067 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 934 treesize of output 760 [2024-11-14 02:58:57,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 309 treesize of output 153 [2024-11-14 02:58:57,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 269 treesize of output 143 [2024-11-14 02:58:57,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:57,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:57,194 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 5 treesize of output 3 [2024-11-14 02:58:57,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:57,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:57,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:57,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-14 02:58:57,219 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 5 treesize of output 3 [2024-11-14 02:58:57,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1058 treesize of output 819 [2024-11-14 02:58:57,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:57,358 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:57,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:57,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:57,391 INFO L349 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2024-11-14 02:58:57,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 944 treesize of output 1149 [2024-11-14 02:58:57,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:57,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:58:57,581 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:57,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 270 [2024-11-14 02:58:57,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 232 [2024-11-14 02:58:57,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:57,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:57,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:57,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:58:57,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 02:58:58,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:58,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-14 02:58:58,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:58:58,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:58:58,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:58,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:58,428 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 7 treesize of output 5 [2024-11-14 02:58:58,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:58,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:58,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,088 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 7 treesize of output 5 [2024-11-14 02:58:59,145 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 7 treesize of output 5 [2024-11-14 02:58:59,194 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 7 treesize of output 5 [2024-11-14 02:58:59,251 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 7 treesize of output 5 [2024-11-14 02:58:59,329 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 7 treesize of output 5 [2024-11-14 02:58:59,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:58:59,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:59:00,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:59:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:00,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:00,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:00,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:00,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:00,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:00,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:59:00,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:59:00,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:59:00,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:59:00,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 478 [2024-11-14 02:59:00,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:59:00,341 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 7 treesize of output 5 [2024-11-14 02:59:00,367 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 7 treesize of output 5 [2024-11-14 02:59:00,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:59:00,420 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 65 treesize of output 59 [2024-11-14 02:59:00,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 02:59:00,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2024-11-14 02:59:00,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:59:00,494 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 02:59:00,541 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 7 treesize of output 5 [2024-11-14 02:59:00,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-14 02:59:00,564 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 650 treesize of output 536 [2024-11-14 02:59:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:00,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:00,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_500) .cse0) .cse1) 0)) (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_499) .cse0) .cse1) 0)))) is different from false [2024-11-14 02:59:01,096 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2024-11-14 02:59:01,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 236 [2024-11-14 02:59:08,293 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse62 (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse61 (= .cse62 0)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse60 (= (select .cse6 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) (let ((.cse7 (not .cse60)) (.cse14 (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (.cse15 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse27 (store .cse1 0 0)) (.cse28 (store .cse6 0 0)) (.cse25 (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (.cse16 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse24 (not (= .cse2 0))) (.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 (- 4) 0))) (.cse29 (not .cse61)) (.cse48 (not (= .cse62 |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse49 (and .cse60 .cse61))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_119 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_118) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_119))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (forall ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_116) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= .cse0 (store .cse1 .cse2 (select .cse0 .cse2)))) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse0 v_DerPreprocessor_116)))))) (= (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (not (= v_DerPreprocessor_118 .cse5)) (not (= (store .cse6 .cse2 (select .cse5 .cse2)) .cse5)))))) (or .cse7 (and (forall ((v_DerPreprocessor_93 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_92 Int)) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 .cse2 v_DerPreprocessor_93) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_92)))) (store .cse13 v_DerPreprocessor_92 (store (store (select .cse13 v_DerPreprocessor_92) 0 0) 4 v_DerPreprocessor_94))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_92 .cse8)) (not (= (select |c_#valid| .cse8) 0)) (= .cse8 0) (forall ((v_DerPreprocessor_97 Int) (v_DerPreprocessor_96 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse2 v_DerPreprocessor_96) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse11 .cse8 (store (store (select .cse11 .cse8) 0 0) 4 v_DerPreprocessor_97))))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= (select (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) v_DerPreprocessor_96))))) (not (= v_DerPreprocessor_93 (select .cse12 .cse2)))))))) (or .cse14 .cse15 .cse16 (forall ((v_DerPreprocessor_88 Int) (v_DerPreprocessor_89 Int) (v_DerPreprocessor_86 Int) (v_DerPreprocessor_87 Int) (v_ArrVal_499 (Array Int Int))) (= (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse6 8 v_DerPreprocessor_86) 0 0) 4 v_DerPreprocessor_87)))) (select (select (store .cse17 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse1 8 v_DerPreprocessor_88) 0 0) 4 v_DerPreprocessor_89)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) (or (forall ((v_DerPreprocessor_93 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_92 Int) (v_DerPreprocessor_95 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 0 v_DerPreprocessor_93) (- 4) v_DerPreprocessor_92)))) (store .cse23 v_DerPreprocessor_92 (store (store (select .cse23 v_DerPreprocessor_92) 0 0) 4 v_DerPreprocessor_94))))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse19 (select .cse18 (- 4)))) (or (not (= v_DerPreprocessor_93 (select .cse18 0))) (= .cse19 0) (not (= (select |c_#valid| .cse19) 0)) (= 0 (let ((.cse20 (store .cse22 .cse19 (store (store (select .cse22 .cse19) 0 0) 4 v_DerPreprocessor_95)))) (select (select (store .cse20 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) .cse24) (or .cse15 .cse25 .cse16 (forall ((v_DerPreprocessor_90 Int) (v_DerPreprocessor_91 Int) (v_ArrVal_499 (Array Int Int))) (= (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse28 4 v_DerPreprocessor_90)))) (select (select (store .cse26 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse27 4 v_DerPreprocessor_91)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))) .cse29) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_119 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_118) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_119))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= v_DerPreprocessor_118 .cse30)) (forall ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_116) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse31)) (not (= .cse32 (store .cse1 .cse2 (select .cse32 .cse2)))) (= .cse31 0) (= (select (select (store .cse33 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse34 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse32 v_DerPreprocessor_116))))))) (not (= (store .cse6 .cse2 (select .cse30 .cse2)) .cse30)))))) (or .cse7 (and (or .cse14 .cse15 (forall ((v_DerPreprocessor_112 Int) (v_DerPreprocessor_113 Int) (v_DerPreprocessor_114 Int) (v_DerPreprocessor_115 Int) (v_ArrVal_500 (Array Int Int))) (= (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse1 8 v_DerPreprocessor_112) 0 0) 4 v_DerPreprocessor_113)))) (select (store .cse35 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse6 8 v_DerPreprocessor_114) 0 0) 4 v_DerPreprocessor_115)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) .cse16) (or .cse15 (forall ((v_DerPreprocessor_110 Int) (v_DerPreprocessor_111 Int) (v_ArrVal_500 (Array Int Int))) (= (select (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse27 4 v_DerPreprocessor_110)))) (select (store .cse36 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse36 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse28 4 v_DerPreprocessor_111)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) .cse25 .cse16) (or .cse24 (forall ((v_DerPreprocessor_109 Int) (v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int) (v_ArrVal_500 (Array Int Int)) (v_DerPreprocessor_106 Int)) (let ((.cse38 (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 0 v_DerPreprocessor_105) (- 4) v_DerPreprocessor_104)))) (store .cse40 v_DerPreprocessor_104 (store (store (select .cse40 v_DerPreprocessor_104) 0 0) 4 v_DerPreprocessor_106))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse37 (select .cse39 (- 4)))) (or (not (= (select |c_#valid| .cse37) 0)) (= (select (select (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store .cse22 .cse37 (store (store (select .cse22 .cse37) 0 0) 4 v_DerPreprocessor_109)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= (select .cse39 0) v_DerPreprocessor_105)) (= .cse37 0))))))) (forall ((v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int) (v_DerPreprocessor_106 Int)) (let ((.cse43 (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 .cse2 v_DerPreprocessor_105) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_104)))) (store .cse46 v_DerPreprocessor_104 (store (store (select .cse46 v_DerPreprocessor_104) 0 0) 4 v_DerPreprocessor_106))))) (let ((.cse45 (select .cse43 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse41 (select .cse45 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse41 v_DerPreprocessor_104)) (forall ((v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_ArrVal_500 (Array Int Int))) (let ((.cse42 (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse2 v_DerPreprocessor_107) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse44 .cse41 (store (store (select .cse44 .cse41) 0 0) 4 v_DerPreprocessor_108))))) (or (not (= (select (select .cse42 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) v_DerPreprocessor_107)) (= (select (select (store .cse43 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (not (= v_DerPreprocessor_105 (select .cse45 .cse2))) (= .cse41 0) (not (= (select |c_#valid| .cse41) 0)))))))) .cse29) (or (forall ((v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_120))) (select (store .cse47 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) .cse48 .cse49) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= .cse50 (store .cse6 .cse2 (select .cse50 .cse2)))) (forall ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_103))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse51 (select .cse54 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse51)) (= .cse51 0) (= (select (select (store .cse52 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse54 (store .cse1 .cse2 (select .cse54 .cse2)))) (not (= .cse54 v_DerPreprocessor_102))))))) (not (= .cse50 v_DerPreprocessor_100)))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101))) (let ((.cse55 (select .cse57 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= .cse55 (store .cse6 .cse2 (select .cse55 .cse2)))) (forall ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_103))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| (select .cse56 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse57 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse57 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse56 (store .cse1 .cse2 (select .cse56 .cse2)))) (not (= .cse56 v_DerPreprocessor_102)))))) (= (select .cse55 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (not (= .cse55 v_DerPreprocessor_100)))))) (or .cse48 .cse49 (forall ((v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (= (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_98))) (select (select (store .cse59 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_99) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))))))) is different from true [2024-11-14 02:59:10,233 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 14 treesize of output 12 [2024-11-14 02:59:10,237 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 12 treesize of output 10 [2024-11-14 02:59:10,246 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 14 treesize of output 12 [2024-11-14 02:59:10,249 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 12 treesize of output 10 [2024-11-14 02:59:10,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse49 (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse48 (= (select .cse5 |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (.cse47 (= .cse49 0))) (let ((.cse28 (not (= .cse49 |c_ULTIMATE.start_main_~head~0#1.base|))) (.cse29 (and .cse48 .cse47)) (.cse10 (not .cse48)) (.cse11 (not .cse47)) (.cse19 (not (= |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (.cse12 (not (= .cse4 0))) (.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse5 (- 4) 0))) (.cse18 (= |c_ULTIMATE.start_main_~head~0#1.base| 0)) (.cse21 (not (= |c_ULTIMATE.start_main_~head~0#1.offset| 0))) (.cse20 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_103) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) .cse0) (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse0 0) (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse0)) (not (= .cse2 (store .cse3 .cse4 (select .cse2 .cse4)))) (not (= .cse2 v_DerPreprocessor_102)))))) (not (= .cse1 v_DerPreprocessor_100)) (not (= .cse1 (store .cse5 .cse4 (select .cse1 .cse4))))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_119 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_118) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_119) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse6 v_DerPreprocessor_118)) (not (= (store .cse5 .cse4 (select .cse6 .cse4)) .cse6)) (= .cse7 0) (forall ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_116) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse8 (store .cse3 .cse4 (select .cse8 .cse4)))) (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse9)) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) .cse9) .cse7) 0) (not (= .cse8 v_DerPreprocessor_116)))))))))) (or .cse10 .cse11 (and (or .cse12 (forall ((v_DerPreprocessor_109 Int) (v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int) (v_ArrVal_500 (Array Int Int)) (v_DerPreprocessor_106 Int)) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse3 0 v_DerPreprocessor_105) (- 4) v_DerPreprocessor_104)))) (let ((.cse14 (store (store (select .cse17 v_DerPreprocessor_104) 0 0) 4 v_DerPreprocessor_106))) (let ((.cse16 (select (store .cse17 v_DerPreprocessor_104 .cse14) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse13 (select .cse16 (- 4)))) (or (not (= (select |c_#valid| .cse13) 0)) (= .cse13 0) (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_104 .cse14) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) .cse13) (select (select (store .cse15 .cse13 (store (store (select .cse15 .cse13) 0 0) 4 v_DerPreprocessor_109)) |c_ULTIMATE.start_main_~head~0#1.base|) (- 4))) 0) (not (= (select .cse16 0) v_DerPreprocessor_105))))))))) (or .cse18 (forall ((v_DerPreprocessor_113 Int) (v_DerPreprocessor_115 Int) (v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) v_DerPreprocessor_113) v_DerPreprocessor_115) 0)) .cse19 .cse20) (or .cse18 (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) 0) 0) 0)) .cse21 .cse20) (forall ((v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int) (v_DerPreprocessor_106 Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_105) |c_ULTIMATE.start_main_~head~0#1.offset| v_DerPreprocessor_104)))) (let ((.cse23 (store (store (select .cse27 v_DerPreprocessor_104) 0 0) 4 v_DerPreprocessor_106))) (let ((.cse26 (select (store .cse27 v_DerPreprocessor_104 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse22 (select .cse26 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= v_DerPreprocessor_104 .cse22)) (forall ((v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_ArrVal_500 (Array Int Int))) (let ((.cse24 (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse5 .cse4 v_DerPreprocessor_107) |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) (store .cse25 .cse22 (store (store (select .cse25 .cse22) 0 0) 4 v_DerPreprocessor_108))) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_104 .cse23) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) .cse22) (select .cse24 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_DerPreprocessor_107 (select .cse24 .cse4)))))) (not (= (select |c_#valid| .cse22) 0)) (not (= (select .cse26 .cse4) v_DerPreprocessor_105)) (= .cse22 0))))))))) (or .cse28 (forall ((v_arrayElimCell_250 Int) (v_arrayElimCell_251 Int) (v_ArrVal_499 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) v_arrayElimCell_250) v_arrayElimCell_251) 0)) .cse29) (or (forall ((v_arrayElimCell_252 Int) (v_arrayElimCell_253 Int) (v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) v_arrayElimCell_252) v_arrayElimCell_253) 0)) .cse28 .cse29) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_119 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_118) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_119) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_116) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse30 0) (not (= .cse31 (store .cse3 .cse4 (select .cse31 .cse4)))) (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse30)) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) .cse30) (select .cse32 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse31 v_DerPreprocessor_116)))))) (not (= .cse32 v_DerPreprocessor_118)) (not (= (store .cse5 .cse4 (select .cse32 .cse4)) .cse32))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= 0 .cse33) (not (= .cse34 v_DerPreprocessor_100)) (forall ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse36 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_103) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) .cse35) .cse33)) (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse35)) (not (= .cse36 (store .cse3 .cse4 (select .cse36 .cse4)))) (not (= .cse36 v_DerPreprocessor_102)))))) (not (= .cse34 (store .cse5 .cse4 (select .cse34 .cse4)))))))) (or .cse10 .cse11 (and (forall ((v_DerPreprocessor_93 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_92 Int)) (let ((.cse38 (select (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse3 .cse4 v_DerPreprocessor_93) |c_ULTIMATE.start_main_~head~0#1.offset| v_DerPreprocessor_92)))) (store .cse42 v_DerPreprocessor_92 (store (store (select .cse42 v_DerPreprocessor_92) 0 0) 4 v_DerPreprocessor_94))) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select |c_#valid| .cse37) 0)) (not (= v_DerPreprocessor_93 (select .cse38 .cse4))) (forall ((v_DerPreprocessor_97 Int) (v_DerPreprocessor_96 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse5 .cse4 v_DerPreprocessor_96) |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) (let ((.cse39 (store (store (select .cse41 .cse37) 0 0) 4 v_DerPreprocessor_97))) (let ((.cse40 (select (store .cse41 .cse37 .cse39) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse37 .cse39) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) .cse37) (select .cse40 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_DerPreprocessor_96 (select .cse40 .cse4)))))))) (= .cse37 0) (not (= v_DerPreprocessor_92 .cse37)))))) (or .cse18 (forall ((v_DerPreprocessor_89 Int) (v_DerPreprocessor_87 Int) (v_ArrVal_499 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) v_DerPreprocessor_89) v_DerPreprocessor_87) 0)) .cse19 .cse20) (or .cse12 (forall ((v_DerPreprocessor_93 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_92 Int) (v_DerPreprocessor_95 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse44 (select (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse3 0 v_DerPreprocessor_93) (- 4) v_DerPreprocessor_92)))) (store .cse46 v_DerPreprocessor_92 (store (store (select .cse46 v_DerPreprocessor_92) 0 0) 4 v_DerPreprocessor_94))) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse43 (select .cse44 (- 4)))) (or (not (= (select |c_#valid| .cse43) 0)) (not (= v_DerPreprocessor_93 (select .cse44 0))) (= (let ((.cse45 (store (store (select .cse15 .cse43) 0 0) 4 v_DerPreprocessor_95))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse43 .cse45) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) .cse43) (select (select (store .cse15 .cse43 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) (- 4)))) 0) (= .cse43 0)))))) (or (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) 0) 0) 0)) .cse18 .cse21 .cse20)))))))) is different from false [2024-11-14 02:59:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 02:59:11,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590609395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:59:11,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1800235097] [2024-11-14 02:59:11,275 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 02:59:11,275 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:59:11,275 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:59:11,276 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:59:11,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:59:15,655 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:59:16,590 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1279#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-14 02:59:16,590 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:59:16,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:59:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-14 02:59:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779943190] [2024-11-14 02:59:16,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:59:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 02:59:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 02:59:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=238, Unknown=3, NotChecked=102, Total=420 [2024-11-14 02:59:16,592 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:19,833 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse63 (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse62 (= .cse63 0)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse47 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse61 (= (select .cse6 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) (let ((.cse7 (not .cse61)) (.cse14 (not (= |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (.cse15 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse27 (store .cse1 0 0)) (.cse28 (store .cse6 0 0)) (.cse25 (not .cse47)) (.cse16 (= 0 |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse24 (not (= .cse2 0))) (.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 (- 4) 0))) (.cse29 (not .cse62)) (.cse49 (not (= .cse63 |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse50 (and .cse61 .cse62))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_119 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_118) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_119))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (forall ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_116) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= .cse0 (store .cse1 .cse2 (select .cse0 .cse2)))) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse0 v_DerPreprocessor_116)))))) (= (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (not (= v_DerPreprocessor_118 .cse5)) (not (= (store .cse6 .cse2 (select .cse5 .cse2)) .cse5)))))) (or .cse7 (and (forall ((v_DerPreprocessor_93 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_92 Int)) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 .cse2 v_DerPreprocessor_93) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_92)))) (store .cse13 v_DerPreprocessor_92 (store (store (select .cse13 v_DerPreprocessor_92) 0 0) 4 v_DerPreprocessor_94))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_DerPreprocessor_92 .cse8)) (not (= (select |c_#valid| .cse8) 0)) (= .cse8 0) (forall ((v_DerPreprocessor_97 Int) (v_DerPreprocessor_96 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse2 v_DerPreprocessor_96) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse11 .cse8 (store (store (select .cse11 .cse8) 0 0) 4 v_DerPreprocessor_97))))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= (select (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) v_DerPreprocessor_96))))) (not (= v_DerPreprocessor_93 (select .cse12 .cse2)))))))) (or .cse14 .cse15 .cse16 (forall ((v_DerPreprocessor_88 Int) (v_DerPreprocessor_89 Int) (v_DerPreprocessor_86 Int) (v_DerPreprocessor_87 Int) (v_ArrVal_499 (Array Int Int))) (= (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse6 8 v_DerPreprocessor_86) 0 0) 4 v_DerPreprocessor_87)))) (select (select (store .cse17 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse1 8 v_DerPreprocessor_88) 0 0) 4 v_DerPreprocessor_89)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) (or (forall ((v_DerPreprocessor_93 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_92 Int) (v_DerPreprocessor_95 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 0 v_DerPreprocessor_93) (- 4) v_DerPreprocessor_92)))) (store .cse23 v_DerPreprocessor_92 (store (store (select .cse23 v_DerPreprocessor_92) 0 0) 4 v_DerPreprocessor_94))))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse19 (select .cse18 (- 4)))) (or (not (= v_DerPreprocessor_93 (select .cse18 0))) (= .cse19 0) (not (= (select |c_#valid| .cse19) 0)) (= 0 (let ((.cse20 (store .cse22 .cse19 (store (store (select .cse22 .cse19) 0 0) 4 v_DerPreprocessor_95)))) (select (select (store .cse20 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) .cse24) (or .cse15 .cse25 .cse16 (forall ((v_DerPreprocessor_90 Int) (v_DerPreprocessor_91 Int) (v_ArrVal_499 (Array Int Int))) (= (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse28 4 v_DerPreprocessor_90)))) (select (select (store .cse26 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse27 4 v_DerPreprocessor_91)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))) .cse29) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_118 (Array Int Int)) (v_DerPreprocessor_119 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_118) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_119))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= v_DerPreprocessor_118 .cse30)) (forall ((v_DerPreprocessor_116 (Array Int Int)) (v_DerPreprocessor_117 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_116) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_117))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse31)) (not (= .cse32 (store .cse1 .cse2 (select .cse32 .cse2)))) (= .cse31 0) (= (select (select (store .cse33 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse34 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse32 v_DerPreprocessor_116))))))) (not (= (store .cse6 .cse2 (select .cse30 .cse2)) .cse30)))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (or .cse7 (and (or .cse14 .cse15 (forall ((v_DerPreprocessor_112 Int) (v_DerPreprocessor_113 Int) (v_DerPreprocessor_114 Int) (v_DerPreprocessor_115 Int) (v_ArrVal_500 (Array Int Int))) (= (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse1 8 v_DerPreprocessor_112) 0 0) 4 v_DerPreprocessor_113)))) (select (store .cse35 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store .cse6 8 v_DerPreprocessor_114) 0 0) 4 v_DerPreprocessor_115)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) .cse16) (or .cse15 (forall ((v_DerPreprocessor_110 Int) (v_DerPreprocessor_111 Int) (v_ArrVal_500 (Array Int Int))) (= (select (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse27 4 v_DerPreprocessor_110)))) (select (store .cse36 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse36 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse28 4 v_DerPreprocessor_111)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) .cse25 .cse16) (or .cse24 (forall ((v_DerPreprocessor_109 Int) (v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int) (v_ArrVal_500 (Array Int Int)) (v_DerPreprocessor_106 Int)) (let ((.cse38 (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 0 v_DerPreprocessor_105) (- 4) v_DerPreprocessor_104)))) (store .cse40 v_DerPreprocessor_104 (store (store (select .cse40 v_DerPreprocessor_104) 0 0) 4 v_DerPreprocessor_106))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse37 (select .cse39 (- 4)))) (or (not (= (select |c_#valid| .cse37) 0)) (= (select (select (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select (store .cse22 .cse37 (store (store (select .cse22 .cse37) 0 0) 4 v_DerPreprocessor_109)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= (select .cse39 0) v_DerPreprocessor_105)) (= .cse37 0))))))) (forall ((v_DerPreprocessor_104 Int) (v_DerPreprocessor_105 Int) (v_DerPreprocessor_106 Int)) (let ((.cse43 (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse1 .cse2 v_DerPreprocessor_105) |c_ULTIMATE.start_main_~x~0#1.offset| v_DerPreprocessor_104)))) (store .cse46 v_DerPreprocessor_104 (store (store (select .cse46 v_DerPreprocessor_104) 0 0) 4 v_DerPreprocessor_106))))) (let ((.cse45 (select .cse43 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse41 (select .cse45 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= .cse41 v_DerPreprocessor_104)) (forall ((v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_ArrVal_500 (Array Int Int))) (let ((.cse42 (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse6 .cse2 v_DerPreprocessor_107) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (store .cse44 .cse41 (store (store (select .cse44 .cse41) 0 0) 4 v_DerPreprocessor_108))))) (or (not (= (select (select .cse42 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) v_DerPreprocessor_107)) (= (select (select (store .cse43 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) (not (= v_DerPreprocessor_105 (select .cse45 .cse2))) (= .cse41 0) (not (= (select |c_#valid| .cse41) 0)))))))) .cse29) .cse47 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or (forall ((v_DerPreprocessor_121 (Array Int Int)) (v_DerPreprocessor_120 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_120))) (select (store .cse48 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_500) (select (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) .cse49 .cse50) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101))) (let ((.cse51 (select .cse53 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= .cse51 (store .cse6 .cse2 (select .cse51 .cse2)))) (forall ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_103))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse52 (select .cse55 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| .cse52)) (= .cse52 0) (= (select (select (store .cse53 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse54 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse55 (store .cse1 .cse2 (select .cse55 .cse2)))) (not (= .cse55 v_DerPreprocessor_102))))))) (not (= .cse51 v_DerPreprocessor_100)))))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_27| Int) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_100) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_101))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= .cse56 (store .cse6 .cse2 (select .cse56 .cse2)))) (forall ((v_DerPreprocessor_103 (Array Int Int)) (v_DerPreprocessor_102 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (let ((.cse59 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_102) |v_ULTIMATE.start_main_#t~mem12#1.base_27| v_DerPreprocessor_103))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= |v_ULTIMATE.start_main_#t~mem12#1.base_27| (select .cse57 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse58 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= .cse57 (store .cse1 .cse2 (select .cse57 .cse2)))) (not (= .cse57 v_DerPreprocessor_102)))))) (= (select .cse56 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (not (= .cse56 v_DerPreprocessor_100)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (or .cse49 .cse50 (forall ((v_DerPreprocessor_98 (Array Int Int)) (v_DerPreprocessor_99 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (= (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_98))) (select (select (store .cse60 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_499) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_99) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))))))) is different from true [2024-11-14 02:59:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:26,000 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-14 02:59:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:59:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 02:59:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:26,002 INFO L225 Difference]: With dead ends: 49 [2024-11-14 02:59:26,002 INFO L226 Difference]: Without dead ends: 42 [2024-11-14 02:59:26,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=95, Invalid=295, Unknown=6, NotChecked=156, Total=552 [2024-11-14 02:59:26,003 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:26,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 3 Unknown, 118 Unchecked, 1.0s Time] [2024-11-14 02:59:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-14 02:59:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-14 02:59:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-14 02:59:26,020 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 16 [2024-11-14 02:59:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:26,020 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-14 02:59:26,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-14 02:59:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:59:26,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:26,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:26,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 02:59:26,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 02:59:26,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:59:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1870530424, now seen corresponding path program 1 times [2024-11-14 02:59:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:26,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513665507] [2024-11-14 02:59:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:27,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513665507] [2024-11-14 02:59:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513665507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:59:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832071958] [2024-11-14 02:59:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:27,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:27,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:59:27,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:59:27,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 02:59:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:27,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 02:59:27,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:59:27,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 02:59:27,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 [2024-11-14 02:59:27,759 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:59:27,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-14 02:59:27,800 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 02:59:27,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 02:59:28,170 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 55 [2024-11-14 02:59:28,208 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 02:59:28,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2024-11-14 02:59:28,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-14 02:59:28,236 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 24 treesize of output 11 [2024-11-14 02:59:28,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-11-14 02:59:28,375 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 23 treesize of output 11 [2024-11-14 02:59:28,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 02:59:28,495 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 20 treesize of output 15 [2024-11-14 02:59:28,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2024-11-14 02:59:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:28,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:28,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_667) |c_ULTIMATE.start_main_~prev~0#1.base|) (+ |c_ULTIMATE.start_main_~prev~0#1.offset| 4)) 1)) is different from false [2024-11-14 02:59:28,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_666)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_667) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 1)) is different from false [2024-11-14 02:59:28,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:59:28,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 188 treesize of output 202 [2024-11-14 02:59:29,144 INFO L349 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2024-11-14 02:59:29,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 175 treesize of output 214 [2024-11-14 02:59:29,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:59:29,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 172 [2024-11-14 02:59:29,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-11-14 02:59:29,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-14 02:59:29,392 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 02:59:29,392 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 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 02:59:29,577 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 8 treesize of output 4 [2024-11-14 02:59:29,714 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 8 treesize of output 4 [2024-11-14 02:59:29,908 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 6 treesize of output 4 [2024-11-14 02:59:29,943 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 5 treesize of output 3 [2024-11-14 02:59:30,051 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-14 02:59:30,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 130 [2024-11-14 02:59:30,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:59:30,090 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 56 treesize of output 55 [2024-11-14 02:59:30,100 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 15 treesize of output 11 [2024-11-14 02:59:30,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:59:30,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2024-11-14 02:59:30,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 02:59:30,647 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 81 treesize of output 60 [2024-11-14 02:59:30,656 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 39 treesize of output 35 [2024-11-14 02:59:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 02:59:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832071958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:59:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1551122586] [2024-11-14 02:59:30,913 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 02:59:30,913 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:59:30,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:59:30,913 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:59:30,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:59:39,822 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 02:59:41,753 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1543#(and (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= 2 |ULTIMATE.start_main_~t1~0#1|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~t2~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4))) (not (= |ULTIMATE.start_main_~t2~0#1| 1)) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-14 02:59:41,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 02:59:41,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 02:59:41,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-14 02:59:41,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211338404] [2024-11-14 02:59:41,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 02:59:41,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 02:59:41,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:59:41,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 02:59:41,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=675, Unknown=2, NotChecked=106, Total=870 [2024-11-14 02:59:41,756 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:59:44,289 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-14 02:59:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 02:59:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 02:59:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:59:44,290 INFO L225 Difference]: With dead ends: 61 [2024-11-14 02:59:44,290 INFO L226 Difference]: Without dead ends: 59 [2024-11-14 02:59:44,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=93, Invalid=725, Unknown=2, NotChecked=110, Total=930 [2024-11-14 02:59:44,291 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:59:44,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 194 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 271 Invalid, 0 Unknown, 102 Unchecked, 2.4s Time] [2024-11-14 02:59:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-14 02:59:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2024-11-14 02:59:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-14 02:59:44,304 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 17 [2024-11-14 02:59:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:59:44,304 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-14 02:59:44,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:59:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-14 02:59:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 02:59:44,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:59:44,305 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:59:44,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 02:59:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 02:59:44,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 02:59:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:59:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2073164225, now seen corresponding path program 2 times [2024-11-14 02:59:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:59:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760143842] [2024-11-14 02:59:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:59:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:59:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:59:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:45,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:59:45,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760143842] [2024-11-14 02:59:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760143842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:59:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950379773] [2024-11-14 02:59:45,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:59:45,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:59:45,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:59:45,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:59:45,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_520c0aec-5629-40ce-b1ce-d1cc0a3f103c/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 02:59:46,569 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 02:59:46,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:59:46,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 02:59:46,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:59:46,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-14 02:59:46,705 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2024-11-14 02:59:46,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 15 [2024-11-14 02:59:46,750 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 02:59:46,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 02:59:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 15 [2024-11-14 02:59:47,514 INFO L349 Elim1Store]: treesize reduction 210, result has 13.2 percent of original size [2024-11-14 02:59:47,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 266 treesize of output 332 [2024-11-14 02:59:47,638 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2024-11-14 02:59:47,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 214 [2024-11-14 02:59:47,717 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 02:59:47,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 177 [2024-11-14 02:59:47,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 164 [2024-11-14 02:59:47,982 INFO L349 Elim1Store]: treesize reduction 145, result has 13.2 percent of original size [2024-11-14 02:59:47,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 190 treesize of output 202 [2024-11-14 02:59:48,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 02:59:48,063 INFO L349 Elim1Store]: treesize reduction 77, result has 1.3 percent of original size [2024-11-14 02:59:48,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 276 treesize of output 221 [2024-11-14 02:59:48,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2024-11-14 02:59:48,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2024-11-14 02:59:48,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 02:59:48,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-11-14 02:59:48,630 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 02:59:48,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 46 [2024-11-14 02:59:48,640 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 34 treesize of output 26 [2024-11-14 02:59:48,647 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 24 treesize of output 18 [2024-11-14 02:59:48,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-14 02:59:48,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-14 02:59:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:59:48,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:59:48,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_852 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_852) .cse0) .cse1) 0)) (forall ((v_ArrVal_853 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_853) .cse0) .cse1) 0)))) is different from false [2024-11-14 02:59:49,007 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2024-11-14 02:59:49,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 240 [2024-11-14 02:59:49,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-14 02:59:49,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-14 02:59:50,389 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse29 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse5 (+ 4 .cse29)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse13 (= .cse29 0)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (and (forall ((v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_152 Int)) (let ((.cse4 (select v_ArrVal_836 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse1 v_DerPreprocessor_150)))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_DerPreprocessor_151))))) (or (not (= v_ArrVal_836 (store .cse0 .cse1 (select v_ArrVal_836 .cse1)))) (= 0 (select (select (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_836))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_DerPreprocessor_152))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= v_DerPreprocessor_150 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_152 Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse10 (select v_ArrVal_836 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse1 v_DerPreprocessor_150)))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse5 v_DerPreprocessor_151))))) (or (not (= v_ArrVal_836 (store .cse0 .cse1 (select v_ArrVal_836 .cse1)))) (= (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_836))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse5 v_DerPreprocessor_152))))) (select (store .cse8 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_DerPreprocessor_150 (select (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))))) .cse13) (forall ((v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_153 Int)) (let ((.cse14 (select v_ArrVal_836 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse15 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse1 v_DerPreprocessor_150)))) (store .cse17 .cse14 (store (select .cse17 .cse14) .cse5 v_DerPreprocessor_151))))) (or (not (= v_ArrVal_836 (store .cse0 .cse1 (select v_ArrVal_836 .cse1)))) (= .cse14 0) (not (= v_DerPreprocessor_150 (select (select .cse15 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_836))) (store .cse16 .cse14 (store (select .cse16 .cse14) .cse5 v_DerPreprocessor_153))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_153 Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse18 (select v_ArrVal_836 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse1 v_DerPreprocessor_150)))) (store .cse22 .cse18 (store (select .cse22 .cse18) .cse5 v_DerPreprocessor_151))))) (or (not (= v_ArrVal_836 (store .cse0 .cse1 (select v_ArrVal_836 .cse1)))) (= .cse18 0) (= (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_836))) (store .cse20 .cse18 (store (select .cse20 .cse18) .cse5 v_DerPreprocessor_153))))) (select (store .cse19 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_DerPreprocessor_150 (select (select .cse21 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))))) (or (not .cse13) (not (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_161| Int)) (or (forall ((v_DerPreprocessor_145 (Array Int Int)) (v_DerPreprocessor_144 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_144) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_145))) (or (not (= (select .cse23 |c_ULTIMATE.start_main_~x~0#1.base|) v_DerPreprocessor_144)) (forall ((v_DerPreprocessor_147 (Array Int Int)) (v_DerPreprocessor_146 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_146) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_147))) (or (not (= (select .cse24 |c_ULTIMATE.start_main_~x~0#1.base|) v_DerPreprocessor_146)) (forall ((v_ArrVal_853 (Array Int Int))) (= (select (select (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))))))) (= |v_ULTIMATE.start_main_~x~0#1.base_161| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_161| Int)) (or (forall ((v_DerPreprocessor_145 (Array Int Int)) (v_DerPreprocessor_144 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_144) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_145))) (or (forall ((v_DerPreprocessor_147 (Array Int Int)) (v_DerPreprocessor_146 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_146) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_147))) (or (not (= (select .cse25 |c_ULTIMATE.start_main_~x~0#1.base|) v_DerPreprocessor_146)) (forall ((v_ArrVal_852 (Array Int Int))) (= (select (select (store .cse25 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (not (= (select .cse26 |c_ULTIMATE.start_main_~x~0#1.base|) v_DerPreprocessor_144))))) (= |v_ULTIMATE.start_main_~x~0#1.base_161| 0))) (or (= 0 |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_DerPreprocessor_149 (Array Int Int)) (v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_148 (Array Int Int))) (= (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_148))) (select (select (store .cse27 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_149) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (forall ((v_DerPreprocessor_149 (Array Int Int)) (v_DerPreprocessor_148 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_149))) (select (store .cse28 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_DerPreprocessor_148) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))))))))) is different from false [2024-11-14 02:59:51,798 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 14 treesize of output 12 [2024-11-14 02:59:51,804 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 12 treesize of output 10 [2024-11-14 02:59:51,816 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 14 treesize of output 12 [2024-11-14 02:59:51,822 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 12 treesize of output 10 [2024-11-14 02:59:51,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse29 (select .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse6 (+ 4 .cse29)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse19 (= .cse29 0)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_153 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse8 .cse1 v_DerPreprocessor_150))) (.cse2 (select v_ArrVal_836 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse4 (store (select .cse7 .cse2) .cse6 v_DerPreprocessor_151))) (let ((.cse0 (select (store .cse7 .cse2 .cse4) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= (select .cse0 .cse1) v_DerPreprocessor_150)) (= .cse2 0) (not (= v_ArrVal_836 (store .cse3 .cse1 (select v_ArrVal_836 .cse1)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 .cse4) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_836))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse6 v_DerPreprocessor_153))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))))) (or (and (forall ((v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_152 Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse10 (select v_ArrVal_836 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse9 (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse8 .cse1 v_DerPreprocessor_150)))) (store .cse13 .cse10 (store (select .cse13 .cse10) .cse6 v_DerPreprocessor_151))) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= (select .cse9 .cse1) v_DerPreprocessor_150)) (= (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_836))) (let ((.cse11 (store (select .cse12 .cse10) .cse6 v_DerPreprocessor_152))) (select (store (store |c_#memory_$Pointer$.base| .cse10 .cse11) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select (select (store .cse12 .cse10 .cse11) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (select .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_ArrVal_836 (store .cse3 .cse1 (select v_ArrVal_836 .cse1)))))))) (forall ((v_ArrVal_853 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_152 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse8 .cse1 v_DerPreprocessor_150))) (.cse15 (select v_ArrVal_836 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse16 (store (select .cse18 .cse15) .cse6 v_DerPreprocessor_151))) (let ((.cse14 (select (store .cse18 .cse15 .cse16) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= (select .cse14 .cse1) v_DerPreprocessor_150)) (not (= v_ArrVal_836 (store .cse3 .cse1 (select v_ArrVal_836 .cse1)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse15 .cse16) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_836))) (store .cse17 .cse15 (store (select .cse17 .cse15) .cse6 v_DerPreprocessor_152))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select .cse14 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))))) .cse19) (forall ((v_ArrVal_836 (Array Int Int)) (v_DerPreprocessor_150 Int) (v_DerPreprocessor_151 Int) (v_DerPreprocessor_153 Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse21 (select v_ArrVal_836 |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse20 (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse8 .cse1 v_DerPreprocessor_150)))) (store .cse24 .cse21 (store (select .cse24 .cse21) .cse6 v_DerPreprocessor_151))) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= (select .cse20 .cse1) v_DerPreprocessor_150)) (= .cse21 0) (not (= v_ArrVal_836 (store .cse3 .cse1 (select v_ArrVal_836 .cse1)))) (= (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_836))) (let ((.cse22 (store (select .cse23 .cse21) .cse6 v_DerPreprocessor_153))) (select (store (store |c_#memory_$Pointer$.base| .cse21 .cse22) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select (select (store .cse23 .cse21 .cse22) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (select .cse20 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (or (not .cse19) (not (= (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.base_161| Int)) (or (forall ((v_DerPreprocessor_145 (Array Int Int)) (v_DerPreprocessor_144 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_144) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_145) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_DerPreprocessor_147 (Array Int Int)) (v_DerPreprocessor_146 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_146) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_147) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_ArrVal_853 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_145) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) (select .cse25 |c_ULTIMATE.start_main_~head~0#1.offset|)) (select .cse26 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= v_DerPreprocessor_146 .cse25))))) (not (= .cse26 v_DerPreprocessor_144))))) (= |v_ULTIMATE.start_main_~x~0#1.base_161| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_161| Int)) (or (= |v_ULTIMATE.start_main_~x~0#1.base_161| 0) (forall ((v_DerPreprocessor_145 (Array Int Int)) (v_DerPreprocessor_144 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_144) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_145) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (forall ((v_DerPreprocessor_147 (Array Int Int)) (v_DerPreprocessor_146 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_DerPreprocessor_146) |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_147) |c_ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_DerPreprocessor_146 .cse27)) (forall ((v_ArrVal_852 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_161| v_DerPreprocessor_147) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) (select .cse27 |c_ULTIMATE.start_main_~head~0#1.offset|)) (select .cse28 |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) (not (= .cse28 v_DerPreprocessor_144))))))) (or (and (forall ((v_ArrVal_852 (Array Int Int)) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_852) v_arrayElimCell_305) v_arrayElimCell_306) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_853) v_arrayElimCell_303) v_arrayElimCell_304) 0))) (= |c_ULTIMATE.start_main_~head~0#1.base| 0)))))))) is different from false [2024-11-14 03:00:01,106 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 66 DAG size of output: 51 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:00:01,106 INFO L349 Elim1Store]: treesize reduction 121, result has 41.5 percent of original size [2024-11-14 03:00:01,107 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 3453 treesize of output 2897 [2024-11-14 03:01:43,186 WARN L286 SmtUtils]: Spent 1.70m on a formula simplification. DAG size of input: 169 DAG size of output: 106 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:01:43,186 INFO L349 Elim1Store]: treesize reduction 509, result has 40.2 percent of original size [2024-11-14 03:01:43,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 397122 treesize of output 230803 [2024-11-14 03:05:49,010 WARN L286 SmtUtils]: Spent 4.06m on a formula simplification. DAG size of input: 2187 DAG size of output: 381 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:05:49,011 INFO L349 Elim1Store]: treesize reduction 8472, result has 12.2 percent of original size [2024-11-14 03:05:49,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 25 select indices, 25 select index equivalence classes, 1 disjoint index pairs (out of 300 index pairs), introduced 33 new quantified variables, introduced 430 case distinctions, treesize of input 68789 treesize of output 65038 [2024-11-14 03:05:53,639 INFO L224 Elim1Store]: Index analysis took 171 ms [2024-11-14 03:06:35,416 WARN L286 SmtUtils]: Spent 41.75s on a formula simplification. DAG size of input: 933 DAG size of output: 310 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:06:35,416 INFO L349 Elim1Store]: treesize reduction 3627, result has 19.5 percent of original size [2024-11-14 03:06:35,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 18 new quantified variables, introduced 154 case distinctions, treesize of input 46992 treesize of output 44817 [2024-11-14 03:06:40,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:40,059 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 31749 treesize of output 31746 [2024-11-14 03:06:41,404 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 31733 treesize of output 31731 [2024-11-14 03:06:42,730 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 31731 treesize of output 31729 [2024-11-14 03:06:44,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:06:44,408 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 31729 treesize of output 31710 [2024-11-14 03:06:50,712 INFO L224 Elim1Store]: Index analysis took 1483 ms [2024-11-14 03:07:10,729 WARN L286 SmtUtils]: Spent 19.05s on a formula simplification. DAG size of input: 481 DAG size of output: 127 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:07:10,729 INFO L349 Elim1Store]: treesize reduction 3187, result has 12.0 percent of original size [2024-11-14 03:07:10,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 71 case distinctions, treesize of input 30768 treesize of output 31135 [2024-11-14 03:07:21,712 INFO L224 Elim1Store]: Index analysis took 2519 ms [2024-11-14 03:10:57,680 WARN L286 SmtUtils]: Spent 3.60m on a formula simplification. DAG size of input: 2864 DAG size of output: 398 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:10:57,681 INFO L349 Elim1Store]: treesize reduction 19699, result has 6.8 percent of original size [2024-11-14 03:10:57,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 23 select indices, 23 select index equivalence classes, 1 disjoint index pairs (out of 253 index pairs), introduced 32 new quantified variables, introduced 476 case distinctions, treesize of input 34406 treesize of output 36200 [2024-11-14 03:11:05,488 WARN L286 SmtUtils]: Spent 7.79s on a formula simplification. DAG size of input: 3199 DAG size of output: 2945 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-14 03:11:11,157 INFO L224 Elim1Store]: Index analysis took 212 ms [2024-11-14 03:11:13,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:13,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 31553 treesize of output 31404 [2024-11-14 03:11:19,182 INFO L224 Elim1Store]: Index analysis took 2843 ms [2024-11-14 03:11:47,440 WARN L286 SmtUtils]: Spent 26.79s on a formula simplification. DAG size of input: 338 DAG size of output: 178 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:11:47,440 INFO L349 Elim1Store]: treesize reduction 889, result has 35.4 percent of original size [2024-11-14 03:11:47,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 56 case distinctions, treesize of input 31620 treesize of output 31718 [2024-11-14 03:11:51,867 INFO L224 Elim1Store]: Index analysis took 527 ms [2024-11-14 03:11:56,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:56,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 30975 treesize of output 30826 [2024-11-14 03:12:12,162 INFO L224 Elim1Store]: Index analysis took 11722 ms [2024-11-14 03:13:07,872 WARN L286 SmtUtils]: Spent 55.70s on a formula simplification. DAG size of input: 822 DAG size of output: 394 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:13:07,873 INFO L349 Elim1Store]: treesize reduction 1887, result has 34.7 percent of original size [2024-11-14 03:13:07,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 1 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 31355 treesize of output 31922 [2024-11-14 03:13:12,811 INFO L224 Elim1Store]: Index analysis took 316 ms