./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:30:05,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:30:05,783 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:30:05,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:30:05,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:30:05,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:30:05,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:30:05,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:30:05,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:30:05,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:30:05,818 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:30:05,819 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:30:05,819 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:30:05,820 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:30:05,820 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:30:05,821 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:30:05,821 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:30:05,822 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:30:05,822 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:30:05,823 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:30:05,823 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:30:05,824 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:30:05,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:30:05,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:30:05,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:30:05,826 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:30:05,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:30:05,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:30:05,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:30:05,827 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:30:05,828 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:30:05,828 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:30:05,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:30:05,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:30:05,829 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:30:05,829 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:30:05,829 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:30:05,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:30:05,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:30:05,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:30:05,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:30:05,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:30:05,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:30:05,831 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:30:05,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:30:05,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:30:05,832 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:30:05,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:30:05,832 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2023-12-02 15:30:06,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:30:06,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:30:06,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:30:06,110 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:30:06,111 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:30:06,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-12-02 15:30:08,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:30:08,998 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:30:08,999 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-12-02 15:30:09,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data/3db58d251/b5c37a37867541de9a85a1c7f4206e9e/FLAG9b556e1f0 [2023-12-02 15:30:09,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data/3db58d251/b5c37a37867541de9a85a1c7f4206e9e [2023-12-02 15:30:09,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:30:09,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:30:09,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:30:09,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:30:09,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:30:09,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25980c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09, skipping insertion in model container [2023-12-02 15:30:09,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,078 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:30:09,312 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:30:09,323 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:30:09,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:30:09,390 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:30:09,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09 WrapperNode [2023-12-02 15:30:09,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:30:09,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:30:09,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:30:09,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:30:09,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,431 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2023-12-02 15:30:09,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:30:09,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:30:09,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:30:09,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:30:09,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:30:09,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:30:09,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:30:09,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:30:09,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (1/1) ... [2023-12-02 15:30:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:30:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:09,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:30:09,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:30:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:30:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:30:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:30:09,618 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:30:09,620 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:30:09,928 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:30:09,971 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:30:09,971 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-02 15:30:09,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:30:09 BoogieIcfgContainer [2023-12-02 15:30:09,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:30:09,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:30:09,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:30:09,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:30:09,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:30:09" (1/3) ... [2023-12-02 15:30:09,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786b1217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:30:09, skipping insertion in model container [2023-12-02 15:30:09,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:30:09" (2/3) ... [2023-12-02 15:30:09,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786b1217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:30:09, skipping insertion in model container [2023-12-02 15:30:09,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:30:09" (3/3) ... [2023-12-02 15:30:09,980 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2023-12-02 15:30:09,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:30:09,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-12-02 15:30:10,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:30:10,035 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4a2cb21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:30:10,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-12-02 15:30:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 86 states have internal predecessors, (101), 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) [2023-12-02 15:30:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:30:10,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:10,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:30:10,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:10,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash 7165, now seen corresponding path program 1 times [2023-12-02 15:30:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73269513] [2023-12-02 15:30:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:10,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73269513] [2023-12-02 15:30:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73269513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:10,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:30:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090349180] [2023-12-02 15:30:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:10,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:30:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:10,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:30:10,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:30:10,268 INFO L87 Difference]: Start difference. First operand has 87 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 86 states have internal predecessors, (101), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:30:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:10,373 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2023-12-02 15:30:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:30:10,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 15:30:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:10,382 INFO L225 Difference]: With dead ends: 86 [2023-12-02 15:30:10,382 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 15:30:10,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:30:10,387 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:10,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 44 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:30:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 15:30:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-12-02 15:30:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 81 states have internal predecessors, (88), 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) [2023-12-02 15:30:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-12-02 15:30:10,416 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 2 [2023-12-02 15:30:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:10,416 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-12-02 15:30:10,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:30:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-12-02 15:30:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:30:10,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:10,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:30:10,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:30:10,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:10,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 7166, now seen corresponding path program 1 times [2023-12-02 15:30:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:10,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339212064] [2023-12-02 15:30:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:10,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339212064] [2023-12-02 15:30:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339212064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:10,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:10,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:30:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850637253] [2023-12-02 15:30:10,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:30:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:10,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:30:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:30:10,502 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:30:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:10,623 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2023-12-02 15:30:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:30:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 15:30:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:10,626 INFO L225 Difference]: With dead ends: 106 [2023-12-02 15:30:10,626 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 15:30:10,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:30:10,628 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 71 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:10,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 80 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:30:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 15:30:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2023-12-02 15:30:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 79 states have internal predecessors, (86), 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) [2023-12-02 15:30:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-12-02 15:30:10,638 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 2 [2023-12-02 15:30:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:10,639 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-12-02 15:30:10,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:30:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-12-02 15:30:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:30:10,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:10,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:30:10,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:30:10,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:10,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738720, now seen corresponding path program 1 times [2023-12-02 15:30:10,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:10,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346275358] [2023-12-02 15:30:10,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:10,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346275358] [2023-12-02 15:30:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346275358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:30:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993741517] [2023-12-02 15:30:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:30:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:10,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:30:10,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:30:10,838 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 15:30:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:10,989 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2023-12-02 15:30:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:30:10,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2023-12-02 15:30:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:10,991 INFO L225 Difference]: With dead ends: 81 [2023-12-02 15:30:10,992 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 15:30:10,992 INFO L412 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 [2023-12-02 15:30:10,994 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:10,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 26 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:30:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 15:30:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2023-12-02 15:30:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 73 states have internal predecessors, (86), 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) [2023-12-02 15:30:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2023-12-02 15:30:11,003 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 6 [2023-12-02 15:30:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:11,003 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2023-12-02 15:30:11,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 15:30:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2023-12-02 15:30:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:30:11,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:11,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:30:11,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:30:11,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:11,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738719, now seen corresponding path program 1 times [2023-12-02 15:30:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:11,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681847247] [2023-12-02 15:30:11,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:11,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681847247] [2023-12-02 15:30:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681847247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:30:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537079602] [2023-12-02 15:30:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:11,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:30:11,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:11,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:30:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:30:11,215 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2023-12-02 15:30:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:11,447 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-12-02 15:30:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:30:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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 [2023-12-02 15:30:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:11,449 INFO L225 Difference]: With dead ends: 96 [2023-12-02 15:30:11,449 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 15:30:11,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:11,450 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 103 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:11,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 50 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:30:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 15:30:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2023-12-02 15:30:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.65) internal successors, (99), 85 states have internal predecessors, (99), 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) [2023-12-02 15:30:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2023-12-02 15:30:11,457 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 6 [2023-12-02 15:30:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:11,458 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2023-12-02 15:30:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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) [2023-12-02 15:30:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2023-12-02 15:30:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 15:30:11,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:11,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:11,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:30:11,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:11,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118797, now seen corresponding path program 1 times [2023-12-02 15:30:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324593990] [2023-12-02 15:30:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:11,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324593990] [2023-12-02 15:30:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324593990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:11,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:30:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141707203] [2023-12-02 15:30:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:11,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:30:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:30:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:30:11,567 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:30:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:11,712 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2023-12-02 15:30:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:30:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 [2023-12-02 15:30:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:11,713 INFO L225 Difference]: With dead ends: 85 [2023-12-02 15:30:11,713 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 15:30:11,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:11,715 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:11,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 85 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:30:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 15:30:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 15:30:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 84 states have internal predecessors, (98), 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) [2023-12-02 15:30:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-12-02 15:30:11,722 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 8 [2023-12-02 15:30:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:11,722 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-12-02 15:30:11,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:30:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-12-02 15:30:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 15:30:11,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:11,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:11,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:30:11,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:11,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118796, now seen corresponding path program 1 times [2023-12-02 15:30:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408038284] [2023-12-02 15:30:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:11,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:11,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408038284] [2023-12-02 15:30:11,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408038284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:11,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:11,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:30:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498413344] [2023-12-02 15:30:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:11,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:30:11,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:30:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:30:11,895 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:30:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:12,045 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2023-12-02 15:30:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:30:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 [2023-12-02 15:30:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:12,046 INFO L225 Difference]: With dead ends: 84 [2023-12-02 15:30:12,046 INFO L226 Difference]: Without dead ends: 84 [2023-12-02 15:30:12,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:12,048 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:12,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:30:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-02 15:30:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2023-12-02 15:30:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 76 states have internal predecessors, (89), 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) [2023-12-02 15:30:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2023-12-02 15:30:12,054 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 8 [2023-12-02 15:30:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:12,054 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2023-12-02 15:30:12,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:30:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2023-12-02 15:30:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:30:12,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:12,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:30:12,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:12,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1479297325, now seen corresponding path program 1 times [2023-12-02 15:30:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:12,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811956835] [2023-12-02 15:30:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:12,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811956835] [2023-12-02 15:30:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811956835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:30:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583137612] [2023-12-02 15:30:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:12,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:30:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:30:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:30:12,215 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-12-02 15:30:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:12,345 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2023-12-02 15:30:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:30:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-12-02 15:30:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:12,346 INFO L225 Difference]: With dead ends: 87 [2023-12-02 15:30:12,346 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 15:30:12,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:12,348 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:12,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 147 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:30:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 15:30:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-12-02 15:30:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.564516129032258) internal successors, (97), 82 states have internal predecessors, (97), 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) [2023-12-02 15:30:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2023-12-02 15:30:12,354 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 12 [2023-12-02 15:30:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:12,354 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2023-12-02 15:30:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-12-02 15:30:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2023-12-02 15:30:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 15:30:12,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:12,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:12,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:30:12,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:12,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1950625586, now seen corresponding path program 1 times [2023-12-02 15:30:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209774816] [2023-12-02 15:30:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:12,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209774816] [2023-12-02 15:30:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209774816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:30:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434764178] [2023-12-02 15:30:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:12,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:12,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:12,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:30:12,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:30:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:12,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:30:12,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:12,710 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 [2023-12-02 15:30:12,749 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:30:12,750 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 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 15:30:12,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:30:12,881 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 17 treesize of output 9 [2023-12-02 15:30:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:12,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434764178] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:30:12,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709716019] [2023-12-02 15:30:13,005 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 15:30:13,005 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:30:13,009 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:30:13,014 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:30:13,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:30:13,557 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:30:16,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1709716019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:16,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:30:16,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 6, 6] total 22 [2023-12-02 15:30:16,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795751039] [2023-12-02 15:30:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:16,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:30:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:30:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=383, Unknown=2, NotChecked=0, Total=506 [2023-12-02 15:30:16,130 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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) [2023-12-02 15:30:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:18,060 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2023-12-02 15:30:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:30:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 [2023-12-02 15:30:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:18,062 INFO L225 Difference]: With dead ends: 90 [2023-12-02 15:30:18,062 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 15:30:18,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=121, Invalid=383, Unknown=2, NotChecked=0, Total=506 [2023-12-02 15:30:18,063 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:18,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 2 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 15:30:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 15:30:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2023-12-02 15:30:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 87 states have internal predecessors, (102), 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) [2023-12-02 15:30:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2023-12-02 15:30:18,070 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 14 [2023-12-02 15:30:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:18,070 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2023-12-02 15:30:18,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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) [2023-12-02 15:30:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2023-12-02 15:30:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:30:18,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:18,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:18,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:30:18,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:18,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:18,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -339904869, now seen corresponding path program 1 times [2023-12-02 15:30:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784095489] [2023-12-02 15:30:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:18,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:18,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784095489] [2023-12-02 15:30:18,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784095489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:18,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:18,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:30:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018980048] [2023-12-02 15:30:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:18,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:30:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:30:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:18,459 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 15:30:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:18,675 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2023-12-02 15:30:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:30:18,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 [2023-12-02 15:30:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:18,677 INFO L225 Difference]: With dead ends: 127 [2023-12-02 15:30:18,677 INFO L226 Difference]: Without dead ends: 127 [2023-12-02 15:30:18,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:30:18,678 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 172 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:18,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 53 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:30:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-02 15:30:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2023-12-02 15:30:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5) internal successors, (108), 91 states have internal predecessors, (108), 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) [2023-12-02 15:30:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2023-12-02 15:30:18,684 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 15 [2023-12-02 15:30:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:18,684 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2023-12-02 15:30:18,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 15:30:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2023-12-02 15:30:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:30:18,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:18,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:18,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:30:18,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:18,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash -339904868, now seen corresponding path program 1 times [2023-12-02 15:30:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:18,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390193830] [2023-12-02 15:30:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:18,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:18,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390193830] [2023-12-02 15:30:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390193830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:18,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:18,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:30:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716952555] [2023-12-02 15:30:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:18,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:30:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:30:18,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:30:18,962 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2023-12-02 15:30:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:19,371 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2023-12-02 15:30:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:30:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 [2023-12-02 15:30:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:19,372 INFO L225 Difference]: With dead ends: 145 [2023-12-02 15:30:19,373 INFO L226 Difference]: Without dead ends: 145 [2023-12-02 15:30:19,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:30:19,374 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 264 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:19,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 87 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:30:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-02 15:30:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 112. [2023-12-02 15:30:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 111 states have internal predecessors, (143), 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) [2023-12-02 15:30:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2023-12-02 15:30:19,380 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 15 [2023-12-02 15:30:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:19,380 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2023-12-02 15:30:19,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2023-12-02 15:30:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2023-12-02 15:30:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:30:19,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:19,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:19,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:30:19,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:19,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1947029978, now seen corresponding path program 1 times [2023-12-02 15:30:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793158424] [2023-12-02 15:30:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:19,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793158424] [2023-12-02 15:30:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793158424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:30:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585373842] [2023-12-02 15:30:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:19,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:30:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:19,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:30:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:30:19,484 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-12-02 15:30:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:19,683 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2023-12-02 15:30:19,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:30:19,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 [2023-12-02 15:30:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:19,684 INFO L225 Difference]: With dead ends: 141 [2023-12-02 15:30:19,684 INFO L226 Difference]: Without dead ends: 141 [2023-12-02 15:30:19,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:30:19,685 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 169 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:19,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 130 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:30:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-02 15:30:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2023-12-02 15:30:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 111 states have internal predecessors, (139), 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) [2023-12-02 15:30:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2023-12-02 15:30:19,690 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 16 [2023-12-02 15:30:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:19,691 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2023-12-02 15:30:19,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-12-02 15:30:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2023-12-02 15:30:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:30:19,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:19,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:19,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 15:30:19,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:19,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash 329551461, now seen corresponding path program 1 times [2023-12-02 15:30:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:19,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439519865] [2023-12-02 15:30:19,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:19,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:19,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:19,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439519865] [2023-12-02 15:30:19,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439519865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:30:19,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:30:19,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:30:19,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631028677] [2023-12-02 15:30:19,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:30:19,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:30:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:30:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:30:19,864 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2023-12-02 15:30:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:20,031 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2023-12-02 15:30:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:30:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2023-12-02 15:30:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:20,032 INFO L225 Difference]: With dead ends: 130 [2023-12-02 15:30:20,032 INFO L226 Difference]: Without dead ends: 130 [2023-12-02 15:30:20,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:30:20,033 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:20,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 130 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:30:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-02 15:30:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2023-12-02 15:30:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 100 states have internal predecessors, (121), 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) [2023-12-02 15:30:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2023-12-02 15:30:20,037 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 18 [2023-12-02 15:30:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:20,037 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2023-12-02 15:30:20,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2023-12-02 15:30:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2023-12-02 15:30:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:30:20,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:20,039 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:20,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 15:30:20,039 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:20,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307920, now seen corresponding path program 1 times [2023-12-02 15:30:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:20,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746174257] [2023-12-02 15:30:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:20,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746174257] [2023-12-02 15:30:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746174257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:30:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95514797] [2023-12-02 15:30:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:20,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:20,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:30:20,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:30:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:20,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 15:30:20,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:20,394 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 [2023-12-02 15:30:20,479 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:30:20,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 15:30:20,531 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 15 treesize of output 1 [2023-12-02 15:30:20,601 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:30:20,601 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 33 treesize of output 24 [2023-12-02 15:30:20,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:20,625 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 [2023-12-02 15:30:20,720 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 25 treesize of output 13 [2023-12-02 15:30:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:20,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:22,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:22,839 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 1 case distinctions, treesize of input 20 treesize of output 21 [2023-12-02 15:30:22,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:22,848 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 34 treesize of output 37 [2023-12-02 15:30:22,853 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 [2023-12-02 15:30:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95514797] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:30:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2041378613] [2023-12-02 15:30:23,121 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:30:23,121 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:30:23,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:30:23,121 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:30:23,122 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:30:28,633 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:30:47,117 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2759#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_118| Int) (|v_ULTIMATE.start_main_~x~0#1.base_139| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_139|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) |ULTIMATE.start_main_~x~0#1.base|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_139|)) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_139|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_139|) 1))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_115| Int) (|v_ULTIMATE.start_main_~x~0#1.base_136| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_115|) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_115|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_136|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_136|) 1) (exists ((|v_#memory_int_68| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_68| |v_ULTIMATE.start_main_~x~0#1.base_136| (store (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~x~0#1.base_136|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_115|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_115| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_136|) |v_ULTIMATE.start_main_~x~0#1.offset_115|))))) (exists ((|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_135| Int) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_114| Int) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int)))) (and (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_114|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_135|)) (= (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~x~0#1.base_135|) |v_ULTIMATE.start_main_~x~0#1.offset_114|) |v_ULTIMATE.start_main_~x~0#1.offset_115|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~x~0#1.base_136| (store (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~x~0#1.base_136|) |v_ULTIMATE.start_main_~x~0#1.offset_115| 0))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_114|) (= (store |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_main_~x~0#1.base_136| (store (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_main_~x~0#1.base_136|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_115|) (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_main_~x~0#1.base_136|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_115|)))) |v_#memory_$Pointer$.base_90|) (= (store |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~x~0#1.base_136| (store (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~x~0#1.base_136|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_115|) (select (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_main_~x~0#1.base_136|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_115|)))) |v_#memory_$Pointer$.offset_86|) (= |v_ULTIMATE.start_main_~x~0#1.base_136| (select (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_main_~x~0#1.base_135|) |v_ULTIMATE.start_main_~x~0#1.offset_114|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_135|) 1) (= (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_main_~x~0#1.base_136| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_main_~x~0#1.base_136|) |v_ULTIMATE.start_main_~x~0#1.offset_115| 0)) |#memory_$Pointer$.base|))))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))))' at error location [2023-12-02 15:30:47,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:30:47,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:30:47,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2023-12-02 15:30:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681408211] [2023-12-02 15:30:47,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:30:47,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 15:30:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:30:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 15:30:47,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1094, Unknown=13, NotChecked=0, Total=1260 [2023-12-02 15:30:47,120 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 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) [2023-12-02 15:30:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:30:48,563 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2023-12-02 15:30:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 15:30:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 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 18 [2023-12-02 15:30:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:30:48,565 INFO L225 Difference]: With dead ends: 238 [2023-12-02 15:30:48,565 INFO L226 Difference]: Without dead ends: 238 [2023-12-02 15:30:48,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=357, Invalid=2281, Unknown=14, NotChecked=0, Total=2652 [2023-12-02 15:30:48,567 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 529 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:30:48,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 386 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 15:30:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-02 15:30:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 144. [2023-12-02 15:30:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 124 states have (on average 1.5483870967741935) internal successors, (192), 143 states have internal predecessors, (192), 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) [2023-12-02 15:30:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2023-12-02 15:30:48,572 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 18 [2023-12-02 15:30:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:30:48,572 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2023-12-02 15:30:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 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) [2023-12-02 15:30:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2023-12-02 15:30:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:30:48,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:30:48,574 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:30:48,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:30:48,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:48,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:30:48,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:30:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307919, now seen corresponding path program 1 times [2023-12-02 15:30:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:30:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230205604] [2023-12-02 15:30:48,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:30:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:49,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:30:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230205604] [2023-12-02 15:30:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230205604] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:30:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701559307] [2023-12-02 15:30:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:30:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:30:49,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:30:49,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:30:49,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:30:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:30:49,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 15:30:49,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:30:49,232 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 [2023-12-02 15:30:49,297 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 8 treesize of output 1 [2023-12-02 15:30:49,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:30:49,313 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 11 treesize of output 11 [2023-12-02 15:30:49,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:30:49,352 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 15 treesize of output 1 [2023-12-02 15:30:49,423 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:30:49,424 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 33 treesize of output 24 [2023-12-02 15:30:49,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:30:49,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:30:49,454 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:30:49,455 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 50 treesize of output 45 [2023-12-02 15:30:49,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:30:49,561 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 25 treesize of output 13 [2023-12-02 15:30:49,566 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 [2023-12-02 15:30:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:49,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:30:49,691 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-02 15:30:49,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:49,794 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 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 15:30:49,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:49,802 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 34 treesize of output 37 [2023-12-02 15:30:49,806 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 [2023-12-02 15:30:49,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:49,822 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 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-02 15:30:49,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:30:49,829 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 29 treesize of output 30 [2023-12-02 15:30:49,831 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:30:49,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-02 15:30:49,838 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:30:49,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 15:30:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:30:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701559307] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:30:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610421493] [2023-12-02 15:30:49,958 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:30:49,958 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:30:49,958 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:30:49,958 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:30:49,958 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:30:53,639 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:31:13,817 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3314#(and (or (< (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (< |ULTIMATE.start_main_~x~0#1.offset| 0)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_128| Int) (|v_ULTIMATE.start_main_~x~0#1.base_150| Int)) (and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_87| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_87| |v_ULTIMATE.start_main_~x~0#1.base_150| (store (store (select |v_#memory_int_87| |v_ULTIMATE.start_main_~x~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_128|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_128| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_150|) |v_ULTIMATE.start_main_~x~0#1.offset_128|))))) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_127| Int) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_149| Int) (|v_#memory_$Pointer$.base_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~x~0#1.base_150| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~x~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_128|) (select (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_main_~x~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_128|)))) |v_#memory_$Pointer$.offset_108|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_149|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_main_~x~0#1.base_150| (store (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_main_~x~0#1.base_150|) |v_ULTIMATE.start_main_~x~0#1.offset_128| 0))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_127|) (= (select (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~x~0#1.base_149|) |v_ULTIMATE.start_main_~x~0#1.offset_127|) |v_ULTIMATE.start_main_~x~0#1.offset_128|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_127|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_149|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_main_~x~0#1.base_150| (store (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_main_~x~0#1.base_150|) |v_ULTIMATE.start_main_~x~0#1.offset_128| 0))) (= (store |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~x~0#1.base_150| (store (select |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~x~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_128|) (select (select |v_#memory_$Pointer$.base_112| |v_ULTIMATE.start_main_~x~0#1.base_150|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_128|)))) |v_#memory_$Pointer$.base_112|) (= |v_ULTIMATE.start_main_~x~0#1.base_150| (select (select |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~x~0#1.base_149|) |v_ULTIMATE.start_main_~x~0#1.offset_127|)))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_150|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_128|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_150|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_128|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_153| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int)) (and (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_153|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_153|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_153|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_153|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) |ULTIMATE.start_main_~x~0#1.base|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))))' at error location [2023-12-02 15:31:13,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:31:13,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:31:13,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-12-02 15:31:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288517573] [2023-12-02 15:31:13,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:31:13,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 15:31:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 15:31:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1319, Unknown=26, NotChecked=74, Total=1560 [2023-12-02 15:31:13,819 INFO L87 Difference]: Start difference. First operand 144 states and 192 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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) [2023-12-02 15:31:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:15,527 INFO L93 Difference]: Finished difference Result 185 states and 217 transitions. [2023-12-02 15:31:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 15:31:15,528 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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 18 [2023-12-02 15:31:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:15,529 INFO L225 Difference]: With dead ends: 185 [2023-12-02 15:31:15,529 INFO L226 Difference]: Without dead ends: 185 [2023-12-02 15:31:15,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=365, Invalid=2470, Unknown=31, NotChecked=104, Total=2970 [2023-12-02 15:31:15,530 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 496 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:15,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 402 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1052 Invalid, 0 Unknown, 190 Unchecked, 0.8s Time] [2023-12-02 15:31:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-02 15:31:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 144. [2023-12-02 15:31:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.4453125) internal successors, (185), 143 states have internal predecessors, (185), 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) [2023-12-02 15:31:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2023-12-02 15:31:15,534 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 18 [2023-12-02 15:31:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:15,534 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2023-12-02 15:31:15,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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) [2023-12-02 15:31:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2023-12-02 15:31:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:31:15,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:15,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:15,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:31:15,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:15,736 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:31:15,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1626106852, now seen corresponding path program 1 times [2023-12-02 15:31:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:15,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134720304] [2023-12-02 15:31:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:15,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:15,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134720304] [2023-12-02 15:31:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134720304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:15,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:15,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:31:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5588497] [2023-12-02 15:31:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:15,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:31:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:15,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:31:15,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:31:15,974 INFO L87 Difference]: Start difference. First operand 144 states and 185 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-02 15:31:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:16,227 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2023-12-02 15:31:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:31:16,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2023-12-02 15:31:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:16,228 INFO L225 Difference]: With dead ends: 164 [2023-12-02 15:31:16,228 INFO L226 Difference]: Without dead ends: 164 [2023-12-02 15:31:16,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:31:16,230 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:16,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 142 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:31:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-02 15:31:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2023-12-02 15:31:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 158 states have internal predecessors, (201), 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) [2023-12-02 15:31:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 201 transitions. [2023-12-02 15:31:16,235 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 201 transitions. Word has length 19 [2023-12-02 15:31:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:16,235 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 201 transitions. [2023-12-02 15:31:16,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-02 15:31:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 201 transitions. [2023-12-02 15:31:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:31:16,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:16,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:16,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 15:31:16,236 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:31:16,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1288229249, now seen corresponding path program 1 times [2023-12-02 15:31:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683403381] [2023-12-02 15:31:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:16,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683403381] [2023-12-02 15:31:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683403381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:31:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69284904] [2023-12-02 15:31:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:16,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:31:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:31:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:31:16,474 INFO L87 Difference]: Start difference. First operand 159 states and 201 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-02 15:31:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:16,866 INFO L93 Difference]: Finished difference Result 192 states and 235 transitions. [2023-12-02 15:31:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:31:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2023-12-02 15:31:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:16,868 INFO L225 Difference]: With dead ends: 192 [2023-12-02 15:31:16,868 INFO L226 Difference]: Without dead ends: 192 [2023-12-02 15:31:16,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:31:16,869 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 113 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:16,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 153 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:31:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-02 15:31:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2023-12-02 15:31:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 152 states have (on average 1.381578947368421) internal successors, (210), 167 states have internal predecessors, (210), 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) [2023-12-02 15:31:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2023-12-02 15:31:16,874 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 19 [2023-12-02 15:31:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:16,875 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2023-12-02 15:31:16,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-02 15:31:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2023-12-02 15:31:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:31:16,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:16,876 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:16,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 15:31:16,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:31:16,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1289095528, now seen corresponding path program 1 times [2023-12-02 15:31:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997724100] [2023-12-02 15:31:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:17,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997724100] [2023-12-02 15:31:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997724100] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701173709] [2023-12-02 15:31:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:17,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:17,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:17,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:31:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:17,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 15:31:17,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:17,318 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 [2023-12-02 15:31:17,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:31:17,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:31:17,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:31:17,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:31:17,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:31:17,420 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 11 treesize of output 11 [2023-12-02 15:31:17,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:31:17,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:31:17,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 15:31:17,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 15:31:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:17,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:31:17,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:17,819 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 13 treesize of output 17 [2023-12-02 15:31:17,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:17,828 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 13 treesize of output 17 [2023-12-02 15:31:18,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:18,144 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 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 15:31:18,148 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 30 treesize of output 22 [2023-12-02 15:31:18,155 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:31:18,155 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 12 treesize of output 11 [2023-12-02 15:31:18,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:18,166 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 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 15:31:18,172 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 30 treesize of output 22 [2023-12-02 15:31:18,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:18,179 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 12 treesize of output 16 [2023-12-02 15:31:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701173709] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:31:18,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12041994] [2023-12-02 15:31:18,217 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 15:31:18,217 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:31:18,217 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:31:18,217 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:31:18,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:31:18,864 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:31:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [12041994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:31:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8, 9] total 32 [2023-12-02 15:31:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068691870] [2023-12-02 15:31:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:24,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 15:31:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 15:31:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=816, Unknown=3, NotChecked=0, Total=992 [2023-12-02 15:31:24,075 INFO L87 Difference]: Start difference. First operand 168 states and 210 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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) [2023-12-02 15:31:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:27,568 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2023-12-02 15:31:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:31:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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 19 [2023-12-02 15:31:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:27,569 INFO L225 Difference]: With dead ends: 179 [2023-12-02 15:31:27,569 INFO L226 Difference]: Without dead ends: 179 [2023-12-02 15:31:27,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=173, Invalid=816, Unknown=3, NotChecked=0, Total=992 [2023-12-02 15:31:27,571 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:27,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 3 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 15:31:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-02 15:31:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2023-12-02 15:31:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 173 states have internal predecessors, (217), 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) [2023-12-02 15:31:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 217 transitions. [2023-12-02 15:31:27,575 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 217 transitions. Word has length 19 [2023-12-02 15:31:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:27,576 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 217 transitions. [2023-12-02 15:31:27,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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) [2023-12-02 15:31:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2023-12-02 15:31:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:31:27,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:27,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:27,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:31:27,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 15:31:27,780 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:31:27,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 495097480, now seen corresponding path program 1 times [2023-12-02 15:31:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86194159] [2023-12-02 15:31:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:27,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86194159] [2023-12-02 15:31:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86194159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:27,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:31:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320531714] [2023-12-02 15:31:27,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:27,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:31:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:31:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:31:27,847 INFO L87 Difference]: Start difference. First operand 174 states and 217 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-12-02 15:31:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:27,952 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2023-12-02 15:31:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:31:27,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-12-02 15:31:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:27,954 INFO L225 Difference]: With dead ends: 176 [2023-12-02 15:31:27,954 INFO L226 Difference]: Without dead ends: 176 [2023-12-02 15:31:27,954 INFO L412 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 [2023-12-02 15:31:27,955 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 66 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:27,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 55 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:31:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-02 15:31:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2023-12-02 15:31:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 155 states have (on average 1.3612903225806452) internal successors, (211), 170 states have internal predecessors, (211), 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) [2023-12-02 15:31:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-12-02 15:31:27,960 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 22 [2023-12-02 15:31:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:27,960 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-12-02 15:31:27,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-12-02 15:31:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-12-02 15:31:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:31:27,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:27,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:27,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 15:31:27,962 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:31:27,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 436286981, now seen corresponding path program 2 times [2023-12-02 15:31:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248548511] [2023-12-02 15:31:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:28,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248548511] [2023-12-02 15:31:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248548511] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235280117] [2023-12-02 15:31:28,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:31:28,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:28,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:28,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:28,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:31:28,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:31:28,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:31:28,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 15:31:28,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:28,513 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 [2023-12-02 15:31:28,588 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:31:28,588 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 11 treesize of output 11 [2023-12-02 15:31:28,625 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 15 treesize of output 1 [2023-12-02 15:31:28,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:31:28,689 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:31:28,690 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 24 treesize of output 17 [2023-12-02 15:31:28,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:31:28,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:31:28,721 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 15:31:28,721 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 55 treesize of output 41 [2023-12-02 15:31:28,727 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 39 treesize of output 33 [2023-12-02 15:31:28,943 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:31:28,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 27 [2023-12-02 15:31:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:29,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:31:29,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,129 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 33 treesize of output 37 [2023-12-02 15:31:29,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,138 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 30 treesize of output 31 [2023-12-02 15:31:29,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,150 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 33 treesize of output 34 [2023-12-02 15:31:29,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,157 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 27 treesize of output 31 [2023-12-02 15:31:29,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,350 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 1 case distinctions, treesize of input 48 treesize of output 49 [2023-12-02 15:31:29,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,357 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 1 case distinctions, treesize of input 40 treesize of output 33 [2023-12-02 15:31:29,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 173 [2023-12-02 15:31:29,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,421 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 190 treesize of output 173 [2023-12-02 15:31:29,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,439 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 156 treesize of output 152 [2023-12-02 15:31:29,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:29,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 176 [2023-12-02 15:31:31,604 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:31:31,604 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 48 treesize of output 1 [2023-12-02 15:31:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235280117] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:31:31,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39165168] [2023-12-02 15:31:31,682 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:31:31,682 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:31:31,682 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:31:31,682 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:31:31,683 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:31:34,258 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:31:54,535 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5410#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_177| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_154| Int)) (and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_114| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_114| |v_ULTIMATE.start_main_~x~0#1.base_177| (store (store (select |v_#memory_int_114| |v_ULTIMATE.start_main_~x~0#1.base_177|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_154|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_154| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_177|) |v_ULTIMATE.start_main_~x~0#1.offset_154|))))) (= 1 (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_177|)) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_154|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_177|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_154|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_176| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_153| Int) (|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int)))) (and (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_153|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_176|)) (= (store |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_main_~x~0#1.base_177| (store (select |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_main_~x~0#1.base_177|) |v_ULTIMATE.start_main_~x~0#1.offset_154| 0)) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.offset_141| |v_ULTIMATE.start_main_~x~0#1.base_177| (store (select |v_#memory_$Pointer$.offset_141| |v_ULTIMATE.start_main_~x~0#1.base_177|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_154|) (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_main_~x~0#1.base_177|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_154|)))) |v_#memory_$Pointer$.offset_142|) (= (select (select |v_#memory_$Pointer$.offset_141| |v_ULTIMATE.start_main_~x~0#1.base_176|) |v_ULTIMATE.start_main_~x~0#1.offset_153|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (= (store |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_main_~x~0#1.base_177| (store (select |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_main_~x~0#1.base_177|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_154|) (select (select |v_#memory_$Pointer$.base_146| |v_ULTIMATE.start_main_~x~0#1.base_177|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_154|)))) |v_#memory_$Pointer$.base_146|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_153|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_176|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_main_~x~0#1.base_177| (store (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_main_~x~0#1.base_177|) |v_ULTIMATE.start_main_~x~0#1.offset_154| 0))) (= |v_ULTIMATE.start_main_~x~0#1.base_177| (select (select |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_main_~x~0#1.base_176|) |v_ULTIMATE.start_main_~x~0#1.offset_153|))))))) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_180| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_157| Int)) (and (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_180|) |v_ULTIMATE.start_main_~x~0#1.offset_157|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_157|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_180|) |v_ULTIMATE.start_main_~x~0#1.offset_157|) |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_157|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_180|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_180|) 1))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))))' at error location [2023-12-02 15:31:54,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:31:54,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:31:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 25 [2023-12-02 15:31:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820598897] [2023-12-02 15:31:54,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:31:54,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 15:31:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 15:31:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1321, Unknown=31, NotChecked=0, Total=1482 [2023-12-02 15:31:54,537 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 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) [2023-12-02 15:31:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:55,854 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2023-12-02 15:31:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 15:31:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 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 22 [2023-12-02 15:31:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:55,856 INFO L225 Difference]: With dead ends: 198 [2023-12-02 15:31:55,856 INFO L226 Difference]: Without dead ends: 198 [2023-12-02 15:31:55,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=243, Invalid=1981, Unknown=32, NotChecked=0, Total=2256 [2023-12-02 15:31:55,857 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 279 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:55,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 505 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 15:31:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-02 15:31:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 170. [2023-12-02 15:31:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 169 states have internal predecessors, (208), 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) [2023-12-02 15:31:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2023-12-02 15:31:55,862 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 22 [2023-12-02 15:31:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:55,862 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2023-12-02 15:31:55,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 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) [2023-12-02 15:31:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2023-12-02 15:31:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:31:55,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:55,863 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:31:55,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:31:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:56,064 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:31:56,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980915, now seen corresponding path program 3 times [2023-12-02 15:31:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868629355] [2023-12-02 15:31:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:56,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868629355] [2023-12-02 15:31:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868629355] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872374559] [2023-12-02 15:31:56,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 15:31:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:56,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:56,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:31:56,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 15:31:56,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:31:56,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 15:31:56,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:56,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:31:56,623 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 11 treesize of output 11 [2023-12-02 15:31:56,635 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 15 treesize of output 1 [2023-12-02 15:31:56,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:31:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:31:56,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:31:56,692 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 11 treesize of output 11 [2023-12-02 15:31:56,704 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 [2023-12-02 15:31:56,778 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:31:56,778 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 3 case distinctions, treesize of input 49 treesize of output 44 [2023-12-02 15:31:56,791 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 8 [2023-12-02 15:31:56,855 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:31:56,855 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 3 case distinctions, treesize of input 58 treesize of output 51 [2023-12-02 15:31:56,951 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 25 treesize of output 13 [2023-12-02 15:31:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:56,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:31:56,981 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_782 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-02 15:31:57,044 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-12-02 15:31:57,045 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 27 treesize of output 26 [2023-12-02 15:31:57,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:57,140 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 16 treesize of output 20 [2023-12-02 15:31:57,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:57,254 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 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 15:31:57,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:57,281 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 68 treesize of output 71 [2023-12-02 15:31:57,288 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 56 treesize of output 52 [2023-12-02 15:31:57,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:31:57,299 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 60 treesize of output 56 [2023-12-02 15:31:57,312 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:31:57,312 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 13 treesize of output 12 [2023-12-02 15:31:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 15:31:57,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872374559] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:31:57,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164838952] [2023-12-02 15:31:57,452 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:31:57,453 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:31:57,453 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:31:57,453 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:31:57,453 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:32:00,999 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:32:19,983 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5974#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_170| Int) (|v_ULTIMATE.start_main_~x~0#1.base_195| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_170|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_170|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_195|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_195|) |v_ULTIMATE.start_main_~x~0#1.offset_170|) |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_195|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_195|) |v_ULTIMATE.start_main_~x~0#1.offset_170|)))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_192| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_167| Int)) (and (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_167|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_192|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_167|) (exists ((|v_#memory_int_133| (Array Int (Array Int Int)))) (= (store |v_#memory_int_133| |v_ULTIMATE.start_main_~x~0#1.base_192| (store (store (select |v_#memory_int_133| |v_ULTIMATE.start_main_~x~0#1.base_192|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_167|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_167| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_192|) |v_ULTIMATE.start_main_~x~0#1.offset_167|))) |#memory_int|)) (exists ((|v_#memory_$Pointer$.base_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_160| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_191| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_166| Int)) (and (= (store |v_#memory_$Pointer$.base_171| |v_ULTIMATE.start_main_~x~0#1.base_192| (store (select |v_#memory_$Pointer$.base_171| |v_ULTIMATE.start_main_~x~0#1.base_192|) |v_ULTIMATE.start_main_~x~0#1.offset_167| 0)) |#memory_$Pointer$.base|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_191|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_166|) (= |v_ULTIMATE.start_main_~x~0#1.base_192| (select (select |v_#memory_$Pointer$.base_170| |v_ULTIMATE.start_main_~x~0#1.base_191|) |v_ULTIMATE.start_main_~x~0#1.offset_166|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_161| |v_ULTIMATE.start_main_~x~0#1.base_192| (store (select |v_#memory_$Pointer$.offset_161| |v_ULTIMATE.start_main_~x~0#1.base_192|) |v_ULTIMATE.start_main_~x~0#1.offset_167| 0))) (= (store |v_#memory_$Pointer$.offset_160| |v_ULTIMATE.start_main_~x~0#1.base_192| (store (select |v_#memory_$Pointer$.offset_160| |v_ULTIMATE.start_main_~x~0#1.base_192|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_167|) (select (select |v_#memory_$Pointer$.offset_161| |v_ULTIMATE.start_main_~x~0#1.base_192|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_167|)))) |v_#memory_$Pointer$.offset_161|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_166|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_191|)) (= (store |v_#memory_$Pointer$.base_170| |v_ULTIMATE.start_main_~x~0#1.base_192| (store (select |v_#memory_$Pointer$.base_170| |v_ULTIMATE.start_main_~x~0#1.base_192|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_167|) (select (select |v_#memory_$Pointer$.base_171| |v_ULTIMATE.start_main_~x~0#1.base_192|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_167|)))) |v_#memory_$Pointer$.base_171|) (= |v_ULTIMATE.start_main_~x~0#1.offset_167| (select (select |v_#memory_$Pointer$.offset_160| |v_ULTIMATE.start_main_~x~0#1.base_191|) |v_ULTIMATE.start_main_~x~0#1.offset_166|)))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_192|) 1))))))' at error location [2023-12-02 15:32:19,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:32:19,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:19,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 25 [2023-12-02 15:32:19,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836372032] [2023-12-02 15:32:19,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:32:19,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 15:32:19,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:19,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 15:32:19,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1259, Unknown=19, NotChecked=72, Total=1482 [2023-12-02 15:32:19,986 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 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) [2023-12-02 15:32:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:21,457 INFO L93 Difference]: Finished difference Result 293 states and 346 transitions. [2023-12-02 15:32:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 15:32:21,458 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 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 24 [2023-12-02 15:32:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:21,459 INFO L225 Difference]: With dead ends: 293 [2023-12-02 15:32:21,459 INFO L226 Difference]: Without dead ends: 293 [2023-12-02 15:32:21,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=355, Invalid=2600, Unknown=19, NotChecked=106, Total=3080 [2023-12-02 15:32:21,460 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 474 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 169 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:21,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 340 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1113 Invalid, 1 Unknown, 222 Unchecked, 0.8s Time] [2023-12-02 15:32:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-02 15:32:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 232. [2023-12-02 15:32:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 216 states have (on average 1.3888888888888888) internal successors, (300), 231 states have internal predecessors, (300), 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) [2023-12-02 15:32:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 300 transitions. [2023-12-02 15:32:21,465 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 300 transitions. Word has length 24 [2023-12-02 15:32:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:21,465 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 300 transitions. [2023-12-02 15:32:21,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 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) [2023-12-02 15:32:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 300 transitions. [2023-12-02 15:32:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:32:21,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:21,466 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:21,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:32:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:21,667 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:32:21,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980916, now seen corresponding path program 2 times [2023-12-02 15:32:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010223613] [2023-12-02 15:32:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:22,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010223613] [2023-12-02 15:32:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010223613] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418018958] [2023-12-02 15:32:22,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:32:22,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:22,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:22,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:22,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:32:22,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:32:22,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:32:22,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 15:32:22,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:22,450 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 [2023-12-02 15:32:22,504 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:32:22,504 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 11 treesize of output 11 [2023-12-02 15:32:22,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:32:22,536 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 15 treesize of output 1 [2023-12-02 15:32:22,615 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:32:22,615 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 16 treesize of output 15 [2023-12-02 15:32:22,631 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:32:22,631 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 24 treesize of output 17 [2023-12-02 15:32:22,672 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:32:22,672 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 24 treesize of output 17 [2023-12-02 15:32:22,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:22,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:22,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:32:22,709 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 11 treesize of output 11 [2023-12-02 15:32:22,757 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:32:22,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-02 15:32:22,776 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:32:22,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 15:32:22,878 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:32:22,878 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 16 treesize of output 15 [2023-12-02 15:32:22,904 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:32:22,905 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 3 case distinctions, treesize of input 51 treesize of output 46 [2023-12-02 15:32:22,915 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 8 [2023-12-02 15:32:23,046 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:32:23,047 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 3 case distinctions, treesize of input 73 treesize of output 64 [2023-12-02 15:32:23,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:23,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:23,084 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 15:32:23,208 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 25 treesize of output 13 [2023-12-02 15:32:23,212 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 [2023-12-02 15:32:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:23,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:23,347 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_906 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_905 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-02 15:32:23,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:23,473 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 54 treesize of output 58 [2023-12-02 15:32:23,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:23,834 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 16 treesize of output 20 [2023-12-02 15:32:24,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:24,109 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 1 case distinctions, treesize of input 92 treesize of output 85 [2023-12-02 15:32:24,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:24,118 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 1 case distinctions, treesize of input 78 treesize of output 79 [2023-12-02 15:32:24,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:24,131 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 161 treesize of output 160 [2023-12-02 15:32:24,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:24,154 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 255 treesize of output 254 [2023-12-02 15:32:24,172 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 172 treesize of output 170 [2023-12-02 15:32:24,180 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 170 treesize of output 166 [2023-12-02 15:32:24,188 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 166 treesize of output 162 [2023-12-02 15:32:24,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:24,202 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 162 treesize of output 163 [2023-12-02 15:32:24,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:24,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 201 [2023-12-02 15:32:24,263 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 148 treesize of output 144 [2023-12-02 15:32:24,274 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 144 treesize of output 142 [2023-12-02 15:32:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 15:32:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418018958] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:32:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [542367008] [2023-12-02 15:32:24,913 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:32:24,913 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:32:24,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:32:24,914 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:32:24,914 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:32:26,766 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:32:48,153 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6722#(and (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_211| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_184| Int)) (and (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_184|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_211|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_184|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_211|) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_184|) |ULTIMATE.start_main_~x~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_211|) |v_ULTIMATE.start_main_~x~0#1.offset_184|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_181| Int) (|v_ULTIMATE.start_main_~x~0#1.base_208| Int)) (and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_155| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_155| |v_ULTIMATE.start_main_~x~0#1.base_208| (store (store (select |v_#memory_int_155| |v_ULTIMATE.start_main_~x~0#1.base_208|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_181| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_208|) |v_ULTIMATE.start_main_~x~0#1.offset_181|))))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_208|)) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_180| Int) (|v_ULTIMATE.start_main_~x~0#1.base_207| Int) (|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_199| (store |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_main_~x~0#1.base_208| (store (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_main_~x~0#1.base_208|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select (select |v_#memory_$Pointer$.base_199| |v_ULTIMATE.start_main_~x~0#1.base_208|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|))))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_180|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_main_~x~0#1.base_208| (store (select |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_main_~x~0#1.base_208|) |v_ULTIMATE.start_main_~x~0#1.offset_181| 0))) (= |v_ULTIMATE.start_main_~x~0#1.base_208| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_main_~x~0#1.base_207|) |v_ULTIMATE.start_main_~x~0#1.offset_180|)) (= (store |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_main_~x~0#1.base_208| (store (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_main_~x~0#1.base_208|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|) (select (select |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_main_~x~0#1.base_208|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_181|)))) |v_#memory_$Pointer$.offset_189|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_207|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_180|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_207|)) (= (store |v_#memory_$Pointer$.base_199| |v_ULTIMATE.start_main_~x~0#1.base_208| (store (select |v_#memory_$Pointer$.base_199| |v_ULTIMATE.start_main_~x~0#1.base_208|) |v_ULTIMATE.start_main_~x~0#1.offset_181| 0)) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_main_~x~0#1.base_207|) |v_ULTIMATE.start_main_~x~0#1.offset_180|) |v_ULTIMATE.start_main_~x~0#1.offset_181|))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_208|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_181|))))) (or (< (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (< |ULTIMATE.start_main_~x~0#1.offset| 0)))' at error location [2023-12-02 15:32:48,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:32:48,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2023-12-02 15:32:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718992168] [2023-12-02 15:32:48,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:32:48,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 15:32:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 15:32:48,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2212, Unknown=39, NotChecked=96, Total=2550 [2023-12-02 15:32:48,156 INFO L87 Difference]: Start difference. First operand 232 states and 300 transitions. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 37 states have internal predecessors, (72), 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) [2023-12-02 15:32:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:51,375 INFO L93 Difference]: Finished difference Result 284 states and 336 transitions. [2023-12-02 15:32:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 15:32:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 37 states have internal predecessors, (72), 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 24 [2023-12-02 15:32:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:51,377 INFO L225 Difference]: With dead ends: 284 [2023-12-02 15:32:51,377 INFO L226 Difference]: Without dead ends: 284 [2023-12-02 15:32:51,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=604, Invalid=4753, Unknown=49, NotChecked=144, Total=5550 [2023-12-02 15:32:51,379 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 531 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 180 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:51,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 503 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1380 Invalid, 1 Unknown, 223 Unchecked, 1.3s Time] [2023-12-02 15:32:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-02 15:32:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 205. [2023-12-02 15:32:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 204 states have internal predecessors, (255), 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) [2023-12-02 15:32:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2023-12-02 15:32:51,383 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 24 [2023-12-02 15:32:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:51,383 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2023-12-02 15:32:51,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 37 states have internal predecessors, (72), 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) [2023-12-02 15:32:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2023-12-02 15:32:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:32:51,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:51,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:51,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:32:51,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 15:32:51,585 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:32:51,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 531544476, now seen corresponding path program 1 times [2023-12-02 15:32:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158404377] [2023-12-02 15:32:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:32:51,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:32:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:32:51,634 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:32:51,634 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:32:51,635 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2023-12-02 15:32:51,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-12-02 15:32:51,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2023-12-02 15:32:51,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-12-02 15:32:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-12-02 15:32:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-12-02 15:32:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-12-02 15:32:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-12-02 15:32:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-12-02 15:32:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-12-02 15:32:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (7 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2023-12-02 15:32:51,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-12-02 15:32:51,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-12-02 15:32:51,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2023-12-02 15:32:51,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (1 of 45 remaining) [2023-12-02 15:32:51,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (0 of 45 remaining) [2023-12-02 15:32:51,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 15:32:51,646 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:51,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:32:51,664 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem9 [2023-12-02 15:32:51,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated [2023-12-02 15:32:51,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:32:51 BoogieIcfgContainer [2023-12-02 15:32:51,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:32:51,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:32:51,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:32:51,676 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:32:51,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:30:09" (3/4) ... [2023-12-02 15:32:51,679 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:32:51,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:32:51,680 INFO L158 Benchmark]: Toolchain (without parser) took 162652.23ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 103.2MB in the beginning and 63.7MB in the end (delta: 39.5MB). Peak memory consumption was 142.8MB. Max. memory is 16.1GB. [2023-12-02 15:32:51,680 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:32:51,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.27ms. Allocated memory is still 138.4MB. Free memory was 102.7MB in the beginning and 85.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:32:51,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.99ms. Allocated memory is still 138.4MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:32:51,681 INFO L158 Benchmark]: Boogie Preprocessor took 33.25ms. Allocated memory is still 138.4MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:32:51,682 INFO L158 Benchmark]: RCFGBuilder took 506.61ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 95.2MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:32:51,682 INFO L158 Benchmark]: TraceAbstraction took 161701.03ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 94.4MB in the beginning and 63.7MB in the end (delta: 30.7MB). Peak memory consumption was 137.3MB. Max. memory is 16.1GB. [2023-12-02 15:32:51,682 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 243.3MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:32:51,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.27ms. Allocated memory is still 138.4MB. Free memory was 102.7MB in the beginning and 85.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.99ms. Allocated memory is still 138.4MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.25ms. Allocated memory is still 138.4MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.61ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 95.2MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 161701.03ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 94.4MB in the beginning and 63.7MB in the end (delta: 30.7MB). Peak memory consumption was 137.3MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 243.3MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) VAL [head={-2:0}] [L1001] head->data = 0 [L1003] SLL* x = head; VAL [head={-2:0}, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1025] EXPR x = head VAL [head={-2:0}, x={-2:0}] [L1026] EXPR x->next VAL [head={-2:0}, x={-2:0}] [L1026] COND FALSE, EXPR !(x->next) [L1033] EXPR x->next [L1033] SLL* y = x->next; [L1034] EXPR x->next = malloc(sizeof(SLL)) [L1035] EXPR x->data = 1 VAL [head={-2:0}, x={-2:0}, y={0:0}] [L1036] EXPR x->next = y [L1023-L1037] { x = head; while (x->next) { if (__VERIFIER_nondet_int()) break; x = x->next; } SLL* y = x->next; x->next = malloc(sizeof(SLL)); x->data = 1; x->next = y; } VAL [head={-2:0}, x={-2:0}] [L1040] x = head VAL [head={-2:0}, x={-2:0}] [L1043] EXPR x->data VAL [head={-2:0}, x={-2:0}] [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next [L1049] x = x->next [L1050] COND FALSE !(\read(*x)) [L1058] x = head VAL [head={-2:0}, x={-2:0}] [L1059] COND TRUE x != ((void*)0) [L1061] head = x VAL [head={-2:0}, x={-2:0}] [L1062] EXPR x->next [L1062] x = x->next [L1063] free(head) VAL [head={-2:0}, x={0:0}] [L1063] free(head) VAL [head={-2:0}, x={0:0}] [L1063] free(head) [L1059] COND FALSE !(x != ((void*)0)) [L1066] return 0; VAL [\result=0, head={-2:0}, x={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 161.6s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 3624 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3624 mSDsluCounter, 3669 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 635 IncrementalHoareTripleChecker+Unchecked, 2898 mSDsCounter, 1001 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8693 IncrementalHoareTripleChecker+Invalid, 10336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1001 mSolverCounterUnsat, 771 mSDtfsCounter, 8693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 237 SyntacticMatches, 18 SemanticMatches, 420 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4372 ImplicationChecksByTransitivity, 117.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=20, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 527 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 471 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 550 ConstructedInterpolants, 56 QuantifiedInterpolants, 9573 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 35 InterpolantComputations, 14 PerfectInterpolantSequences, 17/119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 1.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 29, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 41, TOOLS_POST_TIME: 1.0s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 41, TOOLS_QUANTIFIERELIM_TIME: 1.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 82, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 29, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 345, DAG_COMPRESSION_RETAINED_NODES: 83, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-02 15:32:51,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:32:53,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:32:53,623 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 15:32:53,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:32:53,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:32:53,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:32:53,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:32:53,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:32:53,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:32:53,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:32:53,662 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:32:53,662 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:32:53,663 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:32:53,663 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:32:53,664 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:32:53,664 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:32:53,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:32:53,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:32:53,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:32:53,667 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:32:53,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:32:53,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:32:53,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:32:53,669 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:32:53,670 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:32:53,670 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:32:53,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:32:53,671 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:32:53,671 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:32:53,672 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:32:53,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:32:53,672 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:32:53,673 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:32:53,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:32:53,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:32:53,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:32:53,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:32:53,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:32:53,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:32:53,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:32:53,675 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:32:53,675 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:32:53,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:32:53,676 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:32:53,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:32:53,676 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2023-12-02 15:32:53,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:32:53,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:32:53,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:32:53,999 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:32:54,000 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:32:54,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-12-02 15:32:56,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:32:57,050 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:32:57,051 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-12-02 15:32:57,065 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data/4153f5184/5a28f964ef7e46a487d4aaba61494ace/FLAGf7f831505 [2023-12-02 15:32:57,078 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/data/4153f5184/5a28f964ef7e46a487d4aaba61494ace [2023-12-02 15:32:57,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:32:57,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:32:57,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:32:57,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:32:57,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:32:57,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a552ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57, skipping insertion in model container [2023-12-02 15:32:57,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,146 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:32:57,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:32:57,432 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:32:57,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:32:57,504 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:32:57,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57 WrapperNode [2023-12-02 15:32:57,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:32:57,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:32:57,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:32:57,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:32:57,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,553 INFO L138 Inliner]: procedures = 122, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2023-12-02 15:32:57,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:32:57,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:32:57,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:32:57,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:32:57,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:32:57,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:32:57,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:32:57,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:32:57,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (1/1) ... [2023-12-02 15:32:57,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:32:57,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:57,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:32:57,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:32:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:32:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:32:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:32:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:32:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:32:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:32:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:32:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:32:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:32:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:32:57,782 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:32:57,784 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:32:58,242 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:32:58,289 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:32:58,290 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-02 15:32:58,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:32:58 BoogieIcfgContainer [2023-12-02 15:32:58,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:32:58,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:32:58,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:32:58,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:32:58,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:32:57" (1/3) ... [2023-12-02 15:32:58,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381e804b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:32:58, skipping insertion in model container [2023-12-02 15:32:58,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:32:57" (2/3) ... [2023-12-02 15:32:58,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381e804b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:32:58, skipping insertion in model container [2023-12-02 15:32:58,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:32:58" (3/3) ... [2023-12-02 15:32:58,299 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2023-12-02 15:32:58,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:32:58,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-12-02 15:32:58,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:32:58,379 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@40ac127d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:32:58,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-12-02 15:32:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 43 states have (on average 2.441860465116279) internal successors, (105), 88 states have internal predecessors, (105), 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) [2023-12-02 15:32:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:32:58,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:58,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:32:58,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:32:58,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash 7165, now seen corresponding path program 1 times [2023-12-02 15:32:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:32:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043411138] [2023-12-02 15:32:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:58,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:58,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:32:58,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:32:58,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 15:32:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:58,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:32:58,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:58,560 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 7 [2023-12-02 15:32:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:58,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:58,573 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:32:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043411138] [2023-12-02 15:32:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043411138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:32:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120381432] [2023-12-02 15:32:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:58,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:32:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:58,612 INFO L87 Difference]: Start difference. First operand has 89 states, 43 states have (on average 2.441860465116279) internal successors, (105), 88 states have internal predecessors, (105), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:32:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:58,839 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-12-02 15:32:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 15:32:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:58,850 INFO L225 Difference]: With dead ends: 89 [2023-12-02 15:32:58,850 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 15:32:58,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:58,855 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:58,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 49 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:32:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 15:32:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-12-02 15:32:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 83 states have internal predecessors, (90), 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) [2023-12-02 15:32:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-12-02 15:32:58,892 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 2 [2023-12-02 15:32:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:58,893 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-12-02 15:32:58,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:32:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-12-02 15:32:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:32:58,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:58,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:32:58,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:32:59,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:59,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:32:59,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:59,097 INFO L85 PathProgramCache]: Analyzing trace with hash 7166, now seen corresponding path program 1 times [2023-12-02 15:32:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:32:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523368447] [2023-12-02 15:32:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:59,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:32:59,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:32:59,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 15:32:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:59,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:32:59,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:59,149 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 [2023-12-02 15:32:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:59,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:59,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:32:59,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523368447] [2023-12-02 15:32:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523368447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:59,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:32:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185531064] [2023-12-02 15:32:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:59,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:32:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:32:59,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:32:59,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:59,165 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:32:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:59,462 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-12-02 15:32:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:32:59,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 15:32:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:59,464 INFO L225 Difference]: With dead ends: 110 [2023-12-02 15:32:59,464 INFO L226 Difference]: Without dead ends: 110 [2023-12-02 15:32:59,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:32:59,466 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 73 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:59,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 90 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:32:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-02 15:32:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 82. [2023-12-02 15:32:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 81 states have internal predecessors, (88), 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) [2023-12-02 15:32:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-12-02 15:32:59,476 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 2 [2023-12-02 15:32:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:59,476 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-12-02 15:32:59,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-12-02 15:32:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-12-02 15:32:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:32:59,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:59,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:32:59,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 15:32:59,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:59,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:32:59,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738720, now seen corresponding path program 1 times [2023-12-02 15:32:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:32:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568434678] [2023-12-02 15:32:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:32:59,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:32:59,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 15:32:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:59,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:32:59,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:59,761 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 7 [2023-12-02 15:32:59,808 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:32:59,809 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 15:32:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:59,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:32:59,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:32:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568434678] [2023-12-02 15:32:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568434678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:32:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:32:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:32:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461111145] [2023-12-02 15:32:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:32:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:32:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:32:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:32:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:32:59,829 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 15:33:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:00,210 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-12-02 15:33:00,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:33:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2023-12-02 15:33:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:00,211 INFO L225 Difference]: With dead ends: 84 [2023-12-02 15:33:00,211 INFO L226 Difference]: Without dead ends: 84 [2023-12-02 15:33:00,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:33:00,213 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 111 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:00,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 31 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-02 15:33:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2023-12-02 15:33:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 75 states have internal predecessors, (88), 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) [2023-12-02 15:33:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2023-12-02 15:33:00,220 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 6 [2023-12-02 15:33:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:00,221 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2023-12-02 15:33:00,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 15:33:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2023-12-02 15:33:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:33:00,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:00,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:33:00,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 15:33:00,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:00,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:00,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1967738719, now seen corresponding path program 1 times [2023-12-02 15:33:00,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060246558] [2023-12-02 15:33:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:00,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:00,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:00,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 15:33:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:00,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:33:00,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:00,498 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 [2023-12-02 15:33:00,566 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 15:33:00,566 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 15:33:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:00,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:00,584 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:00,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060246558] [2023-12-02 15:33:00,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060246558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:00,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:00,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:33:00,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336681257] [2023-12-02 15:33:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:00,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:33:00,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:33:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:33:00,586 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 15:33:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:00,971 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-12-02 15:33:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:33:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2023-12-02 15:33:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:00,974 INFO L225 Difference]: With dead ends: 99 [2023-12-02 15:33:00,974 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 15:33:00,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:33:00,975 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:00,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 48 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 15:33:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2023-12-02 15:33:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 87 states have internal predecessors, (100), 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) [2023-12-02 15:33:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2023-12-02 15:33:00,983 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 6 [2023-12-02 15:33:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:00,984 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2023-12-02 15:33:00,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 15:33:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2023-12-02 15:33:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 15:33:00,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:00,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:00,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 15:33:01,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:01,185 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:01,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118797, now seen corresponding path program 1 times [2023-12-02 15:33:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936563164] [2023-12-02 15:33:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:01,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:01,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:01,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:01,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 15:33:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:01,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:33:01,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:01,247 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 7 [2023-12-02 15:33:01,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:33:01,279 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 19 treesize of output 11 [2023-12-02 15:33:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:01,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:01,289 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:01,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936563164] [2023-12-02 15:33:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936563164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:33:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18480233] [2023-12-02 15:33:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:01,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:33:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:33:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:33:01,292 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:33:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:01,689 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2023-12-02 15:33:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:33:01,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 [2023-12-02 15:33:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:01,690 INFO L225 Difference]: With dead ends: 87 [2023-12-02 15:33:01,690 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 15:33:01,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:33:01,691 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:01,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 15:33:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-02 15:33:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.596774193548387) internal successors, (99), 86 states have internal predecessors, (99), 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) [2023-12-02 15:33:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-12-02 15:33:01,699 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 8 [2023-12-02 15:33:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:01,699 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-12-02 15:33:01,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:33:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-12-02 15:33:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 15:33:01,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:01,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:01,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 15:33:01,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:01,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:01,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:01,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1211118796, now seen corresponding path program 1 times [2023-12-02 15:33:01,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:01,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574510038] [2023-12-02 15:33:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:01,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:01,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:01,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 15:33:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:01,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 15:33:01,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:02,010 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 [2023-12-02 15:33:02,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:02,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:33:02,070 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 17 treesize of output 9 [2023-12-02 15:33:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:02,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:02,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574510038] [2023-12-02 15:33:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574510038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:02,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:02,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:33:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871662360] [2023-12-02 15:33:02,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:02,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:33:02,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:02,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:33:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:33:02,089 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:33:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:02,505 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2023-12-02 15:33:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:33:02,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 [2023-12-02 15:33:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:02,506 INFO L225 Difference]: With dead ends: 86 [2023-12-02 15:33:02,507 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 15:33:02,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:33:02,508 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:02,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 140 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 15:33:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2023-12-02 15:33:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 78 states have internal predecessors, (90), 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) [2023-12-02 15:33:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-12-02 15:33:02,514 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 8 [2023-12-02 15:33:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:02,514 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-12-02 15:33:02,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2023-12-02 15:33:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-12-02 15:33:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:33:02,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:02,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:02,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-02 15:33:02,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:02,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:02,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1479297325, now seen corresponding path program 1 times [2023-12-02 15:33:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903479213] [2023-12-02 15:33:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:02,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:02,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 15:33:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:02,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 15:33:02,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:02,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:02,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:02,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:02,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:02,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:02,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903479213] [2023-12-02 15:33:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903479213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:33:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904733156] [2023-12-02 15:33:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:02,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:33:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:33:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:33:02,934 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-12-02 15:33:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:03,423 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2023-12-02 15:33:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:33:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-12-02 15:33:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:03,425 INFO L225 Difference]: With dead ends: 118 [2023-12-02 15:33:03,425 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 15:33:03,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:33:03,426 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:03,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 235 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 15:33:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2023-12-02 15:33:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.53125) internal successors, (98), 84 states have internal predecessors, (98), 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) [2023-12-02 15:33:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-12-02 15:33:03,432 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 12 [2023-12-02 15:33:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:03,433 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-12-02 15:33:03,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-12-02 15:33:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-12-02 15:33:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 15:33:03,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:03,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:03,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-02 15:33:03,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:03,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:03,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1950625586, now seen corresponding path program 1 times [2023-12-02 15:33:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:03,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607582402] [2023-12-02 15:33:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:03,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:03,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 15:33:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:03,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:33:03,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:03,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:03,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:03,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:03,782 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607582402] [2023-12-02 15:33:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607582402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:33:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756002408] [2023-12-02 15:33:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:33:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:33:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:33:03,784 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2023-12-02 15:33:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:04,203 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-12-02 15:33:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:33:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 [2023-12-02 15:33:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:04,204 INFO L225 Difference]: With dead ends: 114 [2023-12-02 15:33:04,205 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 15:33:04,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:33:04,206 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 36 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:04,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 166 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 15:33:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2023-12-02 15:33:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.507462686567164) internal successors, (101), 87 states have internal predecessors, (101), 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) [2023-12-02 15:33:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2023-12-02 15:33:04,211 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 14 [2023-12-02 15:33:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:04,211 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2023-12-02 15:33:04,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2023-12-02 15:33:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2023-12-02 15:33:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:33:04,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:04,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:04,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-02 15:33:04,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:04,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:04,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash -339904869, now seen corresponding path program 1 times [2023-12-02 15:33:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:04,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176366430] [2023-12-02 15:33:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:04,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:04,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:04,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:04,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 15:33:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:04,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:33:04,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:04,502 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 7 [2023-12-02 15:33:04,531 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:33:04,532 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 15:33:04,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:33:04,617 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 19 treesize of output 11 [2023-12-02 15:33:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:04,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:04,644 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176366430] [2023-12-02 15:33:04,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176366430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:04,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:04,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:33:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584833698] [2023-12-02 15:33:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:04,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:33:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:33:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:33:04,646 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 15:33:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:05,173 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2023-12-02 15:33:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:33:05,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 [2023-12-02 15:33:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:05,175 INFO L225 Difference]: With dead ends: 118 [2023-12-02 15:33:05,175 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 15:33:05,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:33:05,176 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 209 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:05,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 64 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:33:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 15:33:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2023-12-02 15:33:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 90 states have internal predecessors, (106), 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) [2023-12-02 15:33:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2023-12-02 15:33:05,180 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 15 [2023-12-02 15:33:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:05,181 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2023-12-02 15:33:05,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 15:33:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2023-12-02 15:33:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:33:05,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:05,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:05,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-02 15:33:05,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:05,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:05,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -339904868, now seen corresponding path program 1 times [2023-12-02 15:33:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618385077] [2023-12-02 15:33:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:05,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:05,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:05,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 15:33:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:05,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:33:05,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:05,482 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 [2023-12-02 15:33:05,529 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 15:33:05,529 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 15:33:05,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:33:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:05,652 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 17 treesize of output 9 [2023-12-02 15:33:05,656 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 7 treesize of output 3 [2023-12-02 15:33:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:05,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:05,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618385077] [2023-12-02 15:33:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618385077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:05,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:05,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:33:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436043263] [2023-12-02 15:33:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:05,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:33:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:33:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:33:05,698 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 15:33:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:06,521 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2023-12-02 15:33:06,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:33:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 [2023-12-02 15:33:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:06,523 INFO L225 Difference]: With dead ends: 140 [2023-12-02 15:33:06,523 INFO L226 Difference]: Without dead ends: 140 [2023-12-02 15:33:06,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:33:06,524 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 214 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:06,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 109 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 15:33:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-02 15:33:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2023-12-02 15:33:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 105 states have internal predecessors, (130), 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) [2023-12-02 15:33:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2023-12-02 15:33:06,530 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 15 [2023-12-02 15:33:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:06,530 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2023-12-02 15:33:06,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 15:33:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2023-12-02 15:33:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:33:06,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:06,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:06,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 15:33:06,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:06,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:06,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash 329551461, now seen corresponding path program 1 times [2023-12-02 15:33:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:06,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783489930] [2023-12-02 15:33:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:06,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:06,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 15:33:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:06,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:33:06,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:06,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:33:06,909 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 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 15:33:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:06,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:06,954 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783489930] [2023-12-02 15:33:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783489930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:06,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:06,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:33:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921387105] [2023-12-02 15:33:06,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:06,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:33:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:06,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:33:06,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:33:06,956 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2023-12-02 15:33:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:07,458 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2023-12-02 15:33:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:33:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2023-12-02 15:33:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:07,460 INFO L225 Difference]: With dead ends: 140 [2023-12-02 15:33:07,460 INFO L226 Difference]: Without dead ends: 140 [2023-12-02 15:33:07,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:33:07,461 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 49 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:07,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:33:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-02 15:33:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 109. [2023-12-02 15:33:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 108 states have internal predecessors, (133), 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) [2023-12-02 15:33:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2023-12-02 15:33:07,466 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 18 [2023-12-02 15:33:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:07,466 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2023-12-02 15:33:07,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2023-12-02 15:33:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2023-12-02 15:33:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:33:07,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:07,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:07,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 15:33:07,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:07,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:07,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1426446504, now seen corresponding path program 1 times [2023-12-02 15:33:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122119427] [2023-12-02 15:33:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:07,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:07,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:07,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 15:33:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:07,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:33:07,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:07,793 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 15 treesize of output 1 [2023-12-02 15:33:07,819 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 16 treesize of output 8 [2023-12-02 15:33:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:07,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:07,829 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122119427] [2023-12-02 15:33:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122119427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:33:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372939688] [2023-12-02 15:33:07,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:07,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:33:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:33:07,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:33:07,831 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-02 15:33:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:08,290 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-12-02 15:33:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:33:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-12-02 15:33:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:08,292 INFO L225 Difference]: With dead ends: 131 [2023-12-02 15:33:08,292 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 15:33:08,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:33:08,293 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 152 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:08,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 135 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:33:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 15:33:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2023-12-02 15:33:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 108 states have internal predecessors, (129), 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) [2023-12-02 15:33:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2023-12-02 15:33:08,297 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 18 [2023-12-02 15:33:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:08,297 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2023-12-02 15:33:08,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-02 15:33:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2023-12-02 15:33:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:33:08,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:08,298 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:08,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 15:33:08,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:08,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:08,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307920, now seen corresponding path program 1 times [2023-12-02 15:33:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112598748] [2023-12-02 15:33:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:08,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:08,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 15:33:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:08,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:33:08,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:08,645 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 7 [2023-12-02 15:33:08,717 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:33:08,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:33:08,779 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 15 treesize of output 1 [2023-12-02 15:33:08,878 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:33:08,879 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 35 treesize of output 26 [2023-12-02 15:33:08,916 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:33:08,917 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 36 treesize of output 35 [2023-12-02 15:33:09,044 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 27 treesize of output 15 [2023-12-02 15:33:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:09,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:09,207 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_314) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:33:09,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:09,220 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 15:33:09,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:09,237 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 38 treesize of output 41 [2023-12-02 15:33:09,242 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 9 treesize of output 7 [2023-12-02 15:33:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:15,760 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112598748] [2023-12-02 15:33:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112598748] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836589151] [2023-12-02 15:33:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:33:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:33:15,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:33:15,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-02 15:33:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:15,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:33:15,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:16,014 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:33:16,014 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 15:33:16,174 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-12-02 15:33:16,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-12-02 15:33:16,282 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 [2023-12-02 15:33:16,472 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:33:16,472 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 43 treesize of output 32 [2023-12-02 15:33:16,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:33:16,532 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 44 treesize of output 41 [2023-12-02 15:33:16,812 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 35 treesize of output 19 [2023-12-02 15:33:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:16,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:16,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_354) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 15:33:16,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_354) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-12-02 15:33:16,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:16,935 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 15:33:16,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:16,958 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 38 treesize of output 41 [2023-12-02 15:33:16,963 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 9 treesize of output 7 [2023-12-02 15:33:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1836589151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860012088] [2023-12-02 15:33:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:21,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:33:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:33:21,574 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:33:21,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 15:33:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:21,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 15:33:21,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:21,752 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:33:21,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:33:21,786 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 15 treesize of output 1 [2023-12-02 15:33:21,833 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:33:21,833 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 35 treesize of output 26 [2023-12-02 15:33:21,866 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:33:21,866 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 36 treesize of output 35 [2023-12-02 15:33:21,943 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 27 treesize of output 15 [2023-12-02 15:33:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:21,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:21,998 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_392) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-12-02 15:33:22,013 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_392) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:33:22,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:22,021 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 15:33:22,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:22,034 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 38 treesize of output 41 [2023-12-02 15:33:22,039 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 9 treesize of output 7 [2023-12-02 15:33:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860012088] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:26,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:33:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 9, 9] total 29 [2023-12-02 15:33:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938137371] [2023-12-02 15:33:26,357 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:33:26,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 15:33:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 15:33:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=463, Unknown=7, NotChecked=250, Total=870 [2023-12-02 15:33:26,359 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 30 states have internal predecessors, (65), 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) [2023-12-02 15:33:29,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 15:33:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:33,618 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2023-12-02 15:33:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 15:33:33,619 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 30 states have internal predecessors, (65), 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 18 [2023-12-02 15:33:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:33,621 INFO L225 Difference]: With dead ends: 236 [2023-12-02 15:33:33,621 INFO L226 Difference]: Without dead ends: 236 [2023-12-02 15:33:33,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=343, Invalid=1225, Unknown=12, NotChecked=400, Total=1980 [2023-12-02 15:33:33,623 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 698 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 141 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 1278 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:33,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 356 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 889 Invalid, 18 Unknown, 1278 Unchecked, 4.5s Time] [2023-12-02 15:33:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-02 15:33:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 153. [2023-12-02 15:33:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 152 states have internal predecessors, (202), 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) [2023-12-02 15:33:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2023-12-02 15:33:33,630 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 18 [2023-12-02 15:33:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:33,630 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2023-12-02 15:33:33,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 30 states have internal predecessors, (65), 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) [2023-12-02 15:33:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2023-12-02 15:33:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:33:33,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:33,632 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:33,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 15:33:33,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-02 15:33:34,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-12-02 15:33:34,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:33:34,237 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:34,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2113307919, now seen corresponding path program 1 times [2023-12-02 15:33:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723400737] [2023-12-02 15:33:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:34,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:34,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:34,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 15:33:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:34,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:33:34,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:34,358 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 7 [2023-12-02 15:33:34,428 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:33:34,428 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 13 treesize of output 13 [2023-12-02 15:33:34,440 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 6 treesize of output 5 [2023-12-02 15:33:34,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:34,490 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 15 treesize of output 1 [2023-12-02 15:33:34,586 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:33:34,587 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 16 treesize of output 15 [2023-12-02 15:33:34,593 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 [2023-12-02 15:33:34,613 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:33:34,614 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 33 treesize of output 24 [2023-12-02 15:33:34,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:33:34,661 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 50 treesize of output 45 [2023-12-02 15:33:34,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:33:34,823 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 25 treesize of output 13 [2023-12-02 15:33:34,831 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 [2023-12-02 15:33:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:34,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:35,170 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 15:33:35,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_434) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_434) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_435) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-12-02 15:33:35,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:35,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 1 case distinctions, treesize of input 35 treesize of output 28 [2023-12-02 15:33:35,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:35,253 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 40 treesize of output 39 [2023-12-02 15:33:35,289 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 9 treesize of output 5 [2023-12-02 15:33:35,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:35,305 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 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-02 15:33:35,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:35,318 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 29 treesize of output 30 [2023-12-02 15:33:35,322 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:35,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-02 15:33:35,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:35,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 15:33:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:35,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:35,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723400737] [2023-12-02 15:33:35,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723400737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:35,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136730095] [2023-12-02 15:33:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:35,550 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:33:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:33:35,551 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:33:35,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-02 15:33:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:35,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 15:33:35,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:35,744 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 7 [2023-12-02 15:33:35,872 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:33:35,872 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 13 treesize of output 13 [2023-12-02 15:33:35,888 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 6 treesize of output 5 [2023-12-02 15:33:35,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:35,973 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 15 treesize of output 1 [2023-12-02 15:33:36,123 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:33:36,123 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 16 treesize of output 15 [2023-12-02 15:33:36,149 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:33:36,149 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 33 treesize of output 24 [2023-12-02 15:33:36,221 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:33:36,221 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 50 treesize of output 45 [2023-12-02 15:33:36,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:33:36,437 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 25 treesize of output 13 [2023-12-02 15:33:36,442 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 [2023-12-02 15:33:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:36,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:36,583 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 15:33:36,624 WARN L854 $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|))) (and (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_477) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_478) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_477 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_477) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-12-02 15:33:36,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:36,638 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 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-02 15:33:36,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:36,648 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 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 15:33:36,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:36,666 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 52 treesize of output 55 [2023-12-02 15:33:36,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:36,692 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 82 treesize of output 81 [2023-12-02 15:33:36,783 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 11 treesize of output 9 [2023-12-02 15:33:36,786 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 9 treesize of output 7 [2023-12-02 15:33:36,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:36,805 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 1 case distinctions, treesize of input 35 treesize of output 28 [2023-12-02 15:33:36,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:36,829 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 40 treesize of output 39 [2023-12-02 15:33:36,836 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 9 treesize of output 5 [2023-12-02 15:33:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2136730095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029425594] [2023-12-02 15:33:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:36,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:33:36,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:33:36,963 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:33:36,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 15:33:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:37,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 15:33:37,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:37,099 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 [2023-12-02 15:33:37,117 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:33:37,117 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 13 treesize of output 13 [2023-12-02 15:33:37,133 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 15 treesize of output 1 [2023-12-02 15:33:37,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:37,192 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:33:37,192 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 16 treesize of output 15 [2023-12-02 15:33:37,201 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 [2023-12-02 15:33:37,218 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:33:37,218 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 33 treesize of output 24 [2023-12-02 15:33:37,258 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:33:37,259 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 50 treesize of output 45 [2023-12-02 15:33:37,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:33:37,338 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 25 treesize of output 13 [2023-12-02 15:33:37,343 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 [2023-12-02 15:33:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:37,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:37,474 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 15:33:37,515 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_519) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_519) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_520) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-12-02 15:33:37,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,530 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 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-02 15:33:37,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,540 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 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 15:33:37,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,561 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 52 treesize of output 55 [2023-12-02 15:33:37,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,594 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 82 treesize of output 81 [2023-12-02 15:33:37,599 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 11 treesize of output 9 [2023-12-02 15:33:37,602 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 9 treesize of output 7 [2023-12-02 15:33:37,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,718 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 1 case distinctions, treesize of input 35 treesize of output 28 [2023-12-02 15:33:37,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,743 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 40 treesize of output 39 [2023-12-02 15:33:37,779 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 9 treesize of output 5 [2023-12-02 15:33:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029425594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:37,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:33:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 9, 9] total 27 [2023-12-02 15:33:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511169829] [2023-12-02 15:33:37,851 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:33:37,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 15:33:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 15:33:37,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=392, Unknown=6, NotChecked=270, Total=756 [2023-12-02 15:33:37,853 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 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) [2023-12-02 15:33:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:41,108 INFO L93 Difference]: Finished difference Result 193 states and 227 transitions. [2023-12-02 15:33:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 15:33:41,109 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 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 18 [2023-12-02 15:33:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:41,110 INFO L225 Difference]: With dead ends: 193 [2023-12-02 15:33:41,111 INFO L226 Difference]: Without dead ends: 193 [2023-12-02 15:33:41,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=227, Invalid=913, Unknown=6, NotChecked=414, Total=1560 [2023-12-02 15:33:41,112 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 531 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1149 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:41,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 359 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 849 Invalid, 0 Unknown, 1149 Unchecked, 2.3s Time] [2023-12-02 15:33:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-02 15:33:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 153. [2023-12-02 15:33:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 152 states have internal predecessors, (196), 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) [2023-12-02 15:33:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 196 transitions. [2023-12-02 15:33:41,117 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 196 transitions. Word has length 18 [2023-12-02 15:33:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 196 transitions. [2023-12-02 15:33:41,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 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) [2023-12-02 15:33:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 196 transitions. [2023-12-02 15:33:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:33:41,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:41,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:41,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 15:33:41,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-02 15:33:41,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-12-02 15:33:41,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:33:41,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:41,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1626106852, now seen corresponding path program 1 times [2023-12-02 15:33:41,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:41,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715876374] [2023-12-02 15:33:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:41,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:41,722 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:41,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-02 15:33:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:41,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:33:41,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:41,890 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 7 treesize of output 3 [2023-12-02 15:33:41,898 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 7 treesize of output 3 [2023-12-02 15:33:41,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:41,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:42,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:42,025 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715876374] [2023-12-02 15:33:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715876374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:33:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409767375] [2023-12-02 15:33:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:42,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:33:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:33:42,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:33:42,026 INFO L87 Difference]: Start difference. First operand 153 states and 196 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-02 15:33:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:42,817 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2023-12-02 15:33:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:33:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2023-12-02 15:33:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:42,818 INFO L225 Difference]: With dead ends: 175 [2023-12-02 15:33:42,818 INFO L226 Difference]: Without dead ends: 175 [2023-12-02 15:33:42,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:33:42,819 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:42,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 165 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 15:33:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-02 15:33:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2023-12-02 15:33:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 168 states have internal predecessors, (213), 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) [2023-12-02 15:33:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2023-12-02 15:33:42,824 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 19 [2023-12-02 15:33:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:42,824 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2023-12-02 15:33:42,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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) [2023-12-02 15:33:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2023-12-02 15:33:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:33:42,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:42,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:42,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-02 15:33:43,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:43,025 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:43,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1288229249, now seen corresponding path program 1 times [2023-12-02 15:33:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528884159] [2023-12-02 15:33:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:43,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:43,027 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:43,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 15:33:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:43,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 15:33:43,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:43,122 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 7 [2023-12-02 15:33:43,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 15:33:43,183 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:33:43,183 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 13 treesize of output 13 [2023-12-02 15:33:43,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 15:33:43,219 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 15 treesize of output 1 [2023-12-02 15:33:43,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:33:43,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:33:43,314 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 33 treesize of output 21 [2023-12-02 15:33:43,318 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 21 treesize of output 13 [2023-12-02 15:33:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:43,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:43,371 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528884159] [2023-12-02 15:33:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528884159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:33:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310403296] [2023-12-02 15:33:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:43,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:33:43,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:33:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:33:43,373 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2023-12-02 15:33:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:33:44,985 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2023-12-02 15:33:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:33:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2023-12-02 15:33:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:33:44,987 INFO L225 Difference]: With dead ends: 203 [2023-12-02 15:33:44,987 INFO L226 Difference]: Without dead ends: 203 [2023-12-02 15:33:44,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:33:44,988 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 119 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:33:44,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 174 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 15:33:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-02 15:33:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 178. [2023-12-02 15:33:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 177 states have internal predecessors, (222), 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) [2023-12-02 15:33:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2023-12-02 15:33:44,992 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 19 [2023-12-02 15:33:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:33:44,992 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2023-12-02 15:33:44,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2023-12-02 15:33:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2023-12-02 15:33:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 15:33:44,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:33:44,993 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:33:44,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-02 15:33:45,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:45,193 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:33:45,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:33:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1289095528, now seen corresponding path program 1 times [2023-12-02 15:33:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:33:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715551889] [2023-12-02 15:33:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:33:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:33:45,195 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:33:45,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 15:33:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:45,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 15:33:45,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:45,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:45,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:45,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:45,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:45,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:33:45,407 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 16 treesize of output 15 [2023-12-02 15:33:45,435 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:33:45,435 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 16 treesize of output 15 [2023-12-02 15:33:45,493 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-02 15:33:45,494 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 31 treesize of output 38 [2023-12-02 15:33:45,530 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-02 15:33:45,530 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 35 treesize of output 31 [2023-12-02 15:33:45,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:45,942 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 82 treesize of output 94 [2023-12-02 15:33:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:46,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:46,718 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-12-02 15:33:46,718 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 28 treesize of output 23 [2023-12-02 15:33:46,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:46,989 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 1 case distinctions, treesize of input 13 treesize of output 17 [2023-12-02 15:33:47,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:47,005 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 1 case distinctions, treesize of input 13 treesize of output 17 [2023-12-02 15:33:47,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:47,019 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 1 case distinctions, treesize of input 13 treesize of output 17 [2023-12-02 15:33:47,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:47,035 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 13 treesize of output 17 [2023-12-02 15:33:48,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:48,333 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 24 treesize of output 22 [2023-12-02 15:33:48,335 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 [2023-12-02 15:33:48,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:33:48,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2023-12-02 15:33:48,351 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 38 treesize of output 36 [2023-12-02 15:33:48,360 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 16 treesize of output 12 [2023-12-02 15:33:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:48,366 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715551889] [2023-12-02 15:33:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715551889] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922152782] [2023-12-02 15:33:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:48,366 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:33:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:33:48,367 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:33:48,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-02 15:33:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:48,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 15:33:48,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:48,567 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 7 [2023-12-02 15:33:48,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:48,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:48,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:48,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:33:48,796 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:33:48,796 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 13 treesize of output 13 [2023-12-02 15:33:48,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:33:48,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:33:48,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-02 15:33:48,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 15:33:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:49,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:33:49,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:49,678 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 13 treesize of output 17 [2023-12-02 15:33:49,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:49,689 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 13 treesize of output 17 [2023-12-02 15:33:58,633 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_168| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_665) |v_ULTIMATE.start_main_~x~0#1.base_168| v_arrayElimArr_18) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_18 (_ bv0 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_168|) (_ bv0 1))))) (not (= v_ArrVal_665 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_665 .cse0)))))) (forall ((v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_168| (_ BitVec 32))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_17 (_ bv0 32)))) (not (= v_ArrVal_664 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_664 .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_168|) (_ bv0 1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_664) |v_ULTIMATE.start_main_~x~0#1.base_168| v_arrayElimArr_17) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))))) is different from false [2023-12-02 15:33:58,659 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 38 treesize of output 36 [2023-12-02 15:33:58,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:58,686 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 12 treesize of output 16 [2023-12-02 15:33:58,713 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 38 treesize of output 36 [2023-12-02 15:33:58,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:33:58,726 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 15:33:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [922152782] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:33:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065165387] [2023-12-02 15:33:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:33:58,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:33:58,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:33:58,877 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:33:58,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 15:33:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:33:58,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:33:58,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:33:58,977 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 7 [2023-12-02 15:33:59,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:33:59,263 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 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 15:33:59,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 15:33:59,350 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:33:59,351 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 13 treesize of output 13 [2023-12-02 15:33:59,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:33:59,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:33:59,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-02 15:33:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-02 15:34:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:00,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:34:01,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:01,436 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 13 treesize of output 17 [2023-12-02 15:34:01,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:01,459 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 13 treesize of output 17 [2023-12-02 15:34:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065165387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:34:25,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:34:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 8, 10, 8, 9] total 44 [2023-12-02 15:34:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523062769] [2023-12-02 15:34:25,113 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:34:25,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 15:34:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 15:34:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1667, Unknown=38, NotChecked=84, Total=1980 [2023-12-02 15:34:25,116 INFO L87 Difference]: Start difference. First operand 178 states and 222 transitions. Second operand has 45 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 44 states have internal predecessors, (92), 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) [2023-12-02 15:34:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:37,075 INFO L93 Difference]: Finished difference Result 209 states and 248 transitions. [2023-12-02 15:34:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 15:34:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 44 states have internal predecessors, (92), 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 19 [2023-12-02 15:34:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:37,077 INFO L225 Difference]: With dead ends: 209 [2023-12-02 15:34:37,077 INFO L226 Difference]: Without dead ends: 209 [2023-12-02 15:34:37,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=523, Invalid=3599, Unknown=42, NotChecked=126, Total=4290 [2023-12-02 15:34:37,079 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 354 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:37,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 471 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 944 Invalid, 0 Unknown, 141 Unchecked, 6.0s Time] [2023-12-02 15:34:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-02 15:34:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2023-12-02 15:34:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.3735632183908046) internal successors, (239), 190 states have internal predecessors, (239), 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) [2023-12-02 15:34:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 239 transitions. [2023-12-02 15:34:37,084 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 239 transitions. Word has length 19 [2023-12-02 15:34:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:37,084 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 239 transitions. [2023-12-02 15:34:37,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 44 states have internal predecessors, (92), 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) [2023-12-02 15:34:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 239 transitions. [2023-12-02 15:34:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:34:37,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:37,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:37,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-02 15:34:37,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-02 15:34:37,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 15:34:37,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:34:37,686 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:34:37,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 436286981, now seen corresponding path program 2 times [2023-12-02 15:34:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396029107] [2023-12-02 15:34:37,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:34:37,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:34:37,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:37,687 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:34:37,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 15:34:37,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:34:37,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:34:37,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 15:34:37,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:37,818 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 7 [2023-12-02 15:34:38,003 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:34:38,004 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 13 treesize of output 13 [2023-12-02 15:34:38,070 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 15 treesize of output 1 [2023-12-02 15:34:38,288 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:34:38,288 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 24 treesize of output 17 [2023-12-02 15:34:38,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:34:38,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:34:38,389 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 15:34:38,389 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 55 treesize of output 41 [2023-12-02 15:34:38,399 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 39 treesize of output 33 [2023-12-02 15:34:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:39,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:34:39,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:39,867 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 33 treesize of output 34 [2023-12-02 15:34:39,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:39,885 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 27 treesize of output 31 [2023-12-02 15:34:39,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:39,932 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 33 treesize of output 37 [2023-12-02 15:34:39,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:39,951 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 30 treesize of output 31 [2023-12-02 15:34:40,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:40,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 245 [2023-12-02 15:34:40,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 218 [2023-12-02 15:34:48,264 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 [2023-12-02 15:34:48,273 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:34:48,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2023-12-02 15:34:48,284 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:34:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:48,586 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:34:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396029107] [2023-12-02 15:34:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396029107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:34:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1139874352] [2023-12-02 15:34:48,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:34:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:34:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:34:48,588 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:34:48,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-12-02 15:34:48,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 15:34:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866569287] [2023-12-02 15:34:48,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:34:48,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:34:48,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:34:48,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 1 [2023-12-02 15:34:48,746 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:34:48,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 15:34:48,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:34:48,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:34:48,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:34:48,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:48,987 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:34:48,988 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 13 treesize of output 13 [2023-12-02 15:34:49,041 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 15 treesize of output 1 [2023-12-02 15:34:49,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:34:49,139 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:34:49,139 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 24 treesize of output 17 [2023-12-02 15:34:49,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:34:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:34:49,240 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-02 15:34:49,241 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 55 treesize of output 41 [2023-12-02 15:34:49,259 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 39 treesize of output 33 [2023-12-02 15:34:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:49,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:34:49,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:49,869 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 33 treesize of output 37 [2023-12-02 15:34:49,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:49,888 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 30 treesize of output 31 [2023-12-02 15:34:49,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:49,936 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 33 treesize of output 34 [2023-12-02 15:34:49,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:49,956 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 27 treesize of output 31 [2023-12-02 15:34:50,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:50,573 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 1 case distinctions, treesize of input 48 treesize of output 49 [2023-12-02 15:34:50,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:50,596 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 1 case distinctions, treesize of input 40 treesize of output 33 [2023-12-02 15:34:50,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:50,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 173 [2023-12-02 15:34:50,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:50,958 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 190 treesize of output 173 [2023-12-02 15:34:51,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:51,013 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 156 treesize of output 152 [2023-12-02 15:34:51,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:34:51,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 176 [2023-12-02 15:34:57,752 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:34:57,753 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 48 treesize of output 1 [2023-12-02 15:34:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866569287] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:34:59,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2023-12-02 15:34:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 12] total 18 [2023-12-02 15:34:59,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253326217] [2023-12-02 15:34:59,992 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2023-12-02 15:34:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 15:34:59,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:34:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 15:34:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=257, Unknown=6, NotChecked=0, Total=306 [2023-12-02 15:34:59,993 INFO L87 Difference]: Start difference. First operand 191 states and 239 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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) [2023-12-02 15:35:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:08,434 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2023-12-02 15:35:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:35:08,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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 22 [2023-12-02 15:35:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:08,436 INFO L225 Difference]: With dead ends: 216 [2023-12-02 15:35:08,436 INFO L226 Difference]: Without dead ends: 216 [2023-12-02 15:35:08,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=112, Invalid=532, Unknown=6, NotChecked=0, Total=650 [2023-12-02 15:35:08,437 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 180 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:08,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 398 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-02 15:35:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-02 15:35:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2023-12-02 15:35:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.3641618497109826) internal successors, (236), 189 states have internal predecessors, (236), 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) [2023-12-02 15:35:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2023-12-02 15:35:08,441 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 22 [2023-12-02 15:35:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:08,441 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2023-12-02 15:35:08,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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) [2023-12-02 15:35:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2023-12-02 15:35:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 15:35:08,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:08,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:35:08,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 15:35:08,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 15:35:08,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:08,843 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:35:08,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash -93883673, now seen corresponding path program 1 times [2023-12-02 15:35:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:08,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079103483] [2023-12-02 15:35:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:08,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:35:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:08,844 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:35:08,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-02 15:35:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:08,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:35:08,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:09,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:35:09,367 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079103483] [2023-12-02 15:35:09,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079103483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:35:09,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:35:09,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:35:09,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101330519] [2023-12-02 15:35:09,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:35:09,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:35:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:09,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:35:09,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:35:09,369 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-12-02 15:35:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:09,908 INFO L93 Difference]: Finished difference Result 198 states and 240 transitions. [2023-12-02 15:35:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:35:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2023-12-02 15:35:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:09,910 INFO L225 Difference]: With dead ends: 198 [2023-12-02 15:35:09,910 INFO L226 Difference]: Without dead ends: 198 [2023-12-02 15:35:09,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:35:09,911 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:09,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 64 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:35:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-02 15:35:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2023-12-02 15:35:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.339080459770115) internal successors, (233), 190 states have internal predecessors, (233), 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) [2023-12-02 15:35:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 233 transitions. [2023-12-02 15:35:09,915 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 233 transitions. Word has length 23 [2023-12-02 15:35:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:09,915 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 233 transitions. [2023-12-02 15:35:09,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-12-02 15:35:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 233 transitions. [2023-12-02 15:35:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:35:09,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:09,915 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:35:09,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-02 15:35:10,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:35:10,116 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:35:10,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980915, now seen corresponding path program 3 times [2023-12-02 15:35:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500862165] [2023-12-02 15:35:10,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:35:10,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:35:10,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:10,118 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:35:10,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-02 15:35:10,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:35:10,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:10,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:35:10,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:10,338 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 15:35:10,339 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 1 case distinctions, treesize of input 12 treesize of output 22 [2023-12-02 15:35:10,689 INFO L349 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2023-12-02 15:35:10,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 30 [2023-12-02 15:35:10,773 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 15 treesize of output 1 [2023-12-02 15:35:10,983 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:35:10,983 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 24 treesize of output 17 [2023-12-02 15:35:11,060 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:35:11,060 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 24 treesize of output 17 [2023-12-02 15:35:11,143 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:35:11,143 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 13 treesize of output 13 [2023-12-02 15:35:11,311 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:35:11,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 15:35:11,664 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:35:11,664 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 3 case distinctions, treesize of input 51 treesize of output 46 [2023-12-02 15:35:11,683 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 8 [2023-12-02 15:35:11,963 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:35:11,963 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 3 case distinctions, treesize of input 60 treesize of output 53 [2023-12-02 15:35:12,342 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 27 treesize of output 15 [2023-12-02 15:35:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:12,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:12,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:35:12,793 INFO L349 Elim1Store]: treesize reduction 7, result has 66.7 percent of original size [2023-12-02 15:35:12,793 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 27 treesize of output 26 [2023-12-02 15:35:12,811 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_919) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2023-12-02 15:35:14,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:14,069 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 16 treesize of output 20 [2023-12-02 15:35:16,098 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_32 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_32) .cse0 v_ArrVal_919) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-12-02 15:35:16,186 INFO L349 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2023-12-02 15:35:16,186 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 17 treesize of output 16 [2023-12-02 15:35:16,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:16,584 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 23 treesize of output 24 [2023-12-02 15:35:16,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:16,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 133 [2023-12-02 15:35:16,645 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 26 treesize of output 22 [2023-12-02 15:35:16,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:16,685 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 53 treesize of output 53 [2023-12-02 15:35:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 15:35:19,037 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:35:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500862165] [2023-12-02 15:35:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500862165] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:19,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1380319332] [2023-12-02 15:35:19,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:35:19,038 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:35:19,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:35:19,039 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:35:19,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-12-02 15:35:19,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 15:35:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068941457] [2023-12-02 15:35:19,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:35:19,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:19,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:19,236 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:19,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 15:35:19,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 1 [2023-12-02 15:35:20,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:35:20,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:20,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 15:35:20,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:20,390 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:35:20,391 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 12 treesize of output 12 [2023-12-02 15:35:20,437 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 15 treesize of output 1 [2023-12-02 15:35:20,691 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:35:20,691 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 24 treesize of output 17 [2023-12-02 15:35:20,758 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:35:20,758 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 24 treesize of output 17 [2023-12-02 15:35:20,862 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:35:20,862 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 13 treesize of output 13 [2023-12-02 15:35:20,951 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:35:20,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 15:35:21,367 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:35:21,367 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 3 case distinctions, treesize of input 51 treesize of output 46 [2023-12-02 15:35:21,388 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 8 [2023-12-02 15:35:21,558 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-12-02 15:35:21,558 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 3 case distinctions, treesize of input 60 treesize of output 53 [2023-12-02 15:35:21,740 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 27 treesize of output 15 [2023-12-02 15:35:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:21,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:21,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-12-02 15:35:24,199 INFO L349 Elim1Store]: treesize reduction 7, result has 72.0 percent of original size [2023-12-02 15:35:24,200 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 31 treesize of output 30 [2023-12-02 15:35:25,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:25,477 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 16 treesize of output 20 [2023-12-02 15:35:25,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1033 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_34 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_34) .cse0 v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2023-12-02 15:35:28,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:28,151 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 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 15:35:28,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:28,197 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 68 treesize of output 71 [2023-12-02 15:35:28,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:28,238 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 64 treesize of output 60 [2023-12-02 15:35:28,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 46 treesize of output 42 [2023-12-02 15:35:28,305 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-12-02 15:35:28,306 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 15 treesize of output 14 [2023-12-02 15:35:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 15:35:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068941457] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:32,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2023-12-02 15:35:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13, 13] total 32 [2023-12-02 15:35:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459973921] [2023-12-02 15:35:32,734 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2023-12-02 15:35:32,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 15:35:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:35:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 15:35:32,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=630, Unknown=43, NotChecked=280, Total=1056 [2023-12-02 15:35:32,736 INFO L87 Difference]: Start difference. First operand 191 states and 233 transitions. Second operand has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 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) [2023-12-02 15:35:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:44,684 INFO L93 Difference]: Finished difference Result 296 states and 345 transitions. [2023-12-02 15:35:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 15:35:44,684 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 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 24 [2023-12-02 15:35:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:44,686 INFO L225 Difference]: With dead ends: 296 [2023-12-02 15:35:44,686 INFO L226 Difference]: Without dead ends: 296 [2023-12-02 15:35:44,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=297, Invalid=1570, Unknown=45, NotChecked=440, Total=2352 [2023-12-02 15:35:44,688 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 587 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 165 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1140 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:44,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 652 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1687 Invalid, 2 Unknown, 1140 Unchecked, 9.4s Time] [2023-12-02 15:35:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-02 15:35:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 234. [2023-12-02 15:35:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 217 states have (on average 1.3732718894009217) internal successors, (298), 233 states have internal predecessors, (298), 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) [2023-12-02 15:35:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 298 transitions. [2023-12-02 15:35:44,693 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 298 transitions. Word has length 24 [2023-12-02 15:35:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:44,693 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 298 transitions. [2023-12-02 15:35:44,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 33 states have internal predecessors, (66), 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) [2023-12-02 15:35:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 298 transitions. [2023-12-02 15:35:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:35:44,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:44,694 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:35:44,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-12-02 15:35:44,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 15:35:45,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:45,094 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-02 15:35:45,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:45,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1859980916, now seen corresponding path program 2 times [2023-12-02 15:35:45,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:35:45,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589468361] [2023-12-02 15:35:45,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:35:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:35:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:35:45,096 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:35:45,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-02 15:35:45,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:35:45,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:35:45,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 15:35:45,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:45,266 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 7 [2023-12-02 15:35:45,491 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:35:45,492 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 13 treesize of output 13 [2023-12-02 15:35:45,584 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 15 treesize of output 1 [2023-12-02 15:35:45,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:35:45,893 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:35:45,893 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 16 treesize of output 15 [2023-12-02 15:35:45,978 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:35:45,978 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 24 treesize of output 17 [2023-12-02 15:35:46,103 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:35:46,104 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 24 treesize of output 17 [2023-12-02 15:35:46,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:35:46,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:35:46,415 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-02 15:35:46,415 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 31 treesize of output 15 [2023-12-02 15:35:46,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:35:46,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-02 15:35:46,956 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-12-02 15:35:46,956 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 27 treesize of output 37 [2023-12-02 15:35:47,100 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2023-12-02 15:35:47,100 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 3 case distinctions, treesize of input 54 treesize of output 55 [2023-12-02 15:35:47,151 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 [2023-12-02 15:35:47,180 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 44 treesize of output 32 [2023-12-02 15:35:47,990 INFO L349 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-12-02 15:35:47,991 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 6 case distinctions, treesize of input 96 treesize of output 120 [2023-12-02 15:35:48,466 INFO L349 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-12-02 15:35:48,467 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 116 [2023-12-02 15:35:58,674 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-02 15:35:58,675 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 70 [2023-12-02 15:35:58,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:35:58,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2023-12-02 15:35:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:59,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:00,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:00,996 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 81 treesize of output 81 [2023-12-02 15:36:01,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:01,017 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 75 treesize of output 69 [2023-12-02 15:36:01,115 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 [2023-12-02 15:36:03,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:03,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 188 treesize of output 236 [2023-12-02 15:36:05,032 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 [2023-12-02 15:36:08,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse0 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse1 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 (_ bv0 32)) (= .cse1 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse0) (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse5 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse6) (= (select (select (store .cse5 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse7 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse7 (bvadd .cse7 (_ bv4 32)))) (not (= (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse8 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse8 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse8) .cse6) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse10 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse10 (bvadd .cse10 (_ bv4 32)))) (not (= (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse11 (select (select (store .cse12 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store .cse12 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse13) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse6))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse15 (select (select (store .cse16 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse15 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse16 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse15) (= (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= .cse15 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse17 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse17) .cse6) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse6))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= .cse18 (_ bv0 32)) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse18) (_ bv0 32)) (= (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse20 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse20) .cse6) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse22 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse22 (bvadd .cse22 (_ bv4 32)))) (not (= (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2023-12-02 15:36:10,878 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse0 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse1 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 (_ bv0 32)) (= .cse1 (select (select (store .cse2 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse0) (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse5 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse6) (= (select (select (store .cse5 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse7 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse7 (bvadd .cse7 (_ bv4 32)))) (not (= (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse8 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse8 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse8) .cse6) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse9 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse10 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse10 (bvadd .cse10 (_ bv4 32)))) (not (= (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse11 (select (select (store .cse12 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store .cse12 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse13) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse6))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse15 (select (select (store .cse16 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse15 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (= (select (select (store .cse16 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse15) (= (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= .cse15 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse17 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse17) .cse6) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_36 |c_ULTIMATE.start_main_#t~malloc3#1.offset|))) (not (= (select v_prenex_23 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse6))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= .cse18 (_ bv0 32)) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (bvadd (_ bv4 32) .cse18) (_ bv0 32)) (= (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse19 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse20 (_ bv0 32)) (bvule (bvadd (_ bv4 32) .cse20) .cse6) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_prenex_24 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (not (= (select v_prenex_25 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse22 (select (select (store .cse3 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse22 (bvadd .cse22 (_ bv4 32)))) (not (= (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~malloc3#1.offset|) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from true [2023-12-02 15:36:14,302 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32))))) (and (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse0 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse0 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse2 (_ bv0 32)) (bvule (bvadd .cse2 (_ bv4 32)) .cse3) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse5 (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 (_ bv0 32)) (= (bvadd (_ bv4 32) (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store .cse6 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse7 (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 (_ bv0 32)) (= (select (select (store .cse8 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse7) (= (bvadd (_ bv4 32) (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse9 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse9 (_ bv0 32)) (bvule (bvadd .cse9 (_ bv4 32)) .cse3) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse10 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse10 (bvadd (_ bv4 32) .cse10))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse11 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse12 (_ bv0 32)) (= (bvadd .cse12 (_ bv4 32)) (_ bv0 32)) (= (select (select (store .cse11 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse15 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 (select (select (store .cse14 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse15 (_ bv0 32)) (= (bvadd .cse15 (_ bv4 32)) (_ bv0 32)) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (let ((.cse16 (select (select (store .cse17 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse16 (_ bv0 32)) (= (select (select (store .cse17 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse16) (bvule (bvadd (_ bv4 32) (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32))) (let ((.cse18 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse18 (_ bv0 32)) (bvule (bvadd .cse18 (_ bv4 32)) .cse3) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse19 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse19 (bvadd (_ bv4 32) .cse19))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (= (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse3) (= (select (select (store .cse20 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (= (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse21 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse22 (select (select (store .cse4 |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse22 (bvadd (_ bv4 32) .cse22))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))))))) is different from true [2023-12-02 15:36:16,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,032 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 49 treesize of output 46 [2023-12-02 15:36:16,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,065 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 20 treesize of output 24 [2023-12-02 15:36:16,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,208 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 46 treesize of output 43 [2023-12-02 15:36:16,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,240 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 39 treesize of output 39 [2023-12-02 15:36:16,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,395 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 46 treesize of output 43 [2023-12-02 15:36:16,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,426 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 22 treesize of output 26 [2023-12-02 15:36:16,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-12-02 15:36:16,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,597 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 39 treesize of output 39 [2023-12-02 15:36:16,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,730 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 31 treesize of output 32 [2023-12-02 15:36:16,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,803 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 31 treesize of output 32 [2023-12-02 15:36:16,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,835 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 16 treesize of output 20 [2023-12-02 15:36:16,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,943 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 29 treesize of output 30 [2023-12-02 15:36:16,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:16,975 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 35 treesize of output 36 [2023-12-02 15:36:17,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,080 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 62 treesize of output 56 [2023-12-02 15:36:17,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,110 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 20 treesize of output 24 [2023-12-02 15:36:17,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,242 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 16 treesize of output 20 [2023-12-02 15:36:17,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,269 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 22 treesize of output 26 [2023-12-02 15:36:17,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,379 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 29 treesize of output 30 [2023-12-02 15:36:17,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,410 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 41 treesize of output 41 [2023-12-02 15:36:17,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,550 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 33 treesize of output 33 [2023-12-02 15:36:17,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,583 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 22 treesize of output 26 [2023-12-02 15:36:17,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,699 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 37 treesize of output 37 [2023-12-02 15:36:17,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,788 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 16 treesize of output 20 [2023-12-02 15:36:17,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:17,817 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 41 treesize of output 41 [2023-12-02 15:36:17,940 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_40)) (.cse2 (select v_arrayElimArr_40 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_41) .cse2 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select (store .cse1 .cse2 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse0 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse0) (_ bv0 32)) (= (select (select (store .cse1 .cse2 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse3) (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_46) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse4 (bvadd (_ bv4 32) .cse4))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_48) .cse5 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_47 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_47) .cse5 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse6 (bvadd (_ bv4 32) .cse6))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_51)) (.cse9 (select v_arrayElimArr_51 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 .cse9 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse7 (select (select (store .cse8 .cse9 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_52 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_52) .cse9 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse7 (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_55 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_56) .cse11 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_55))) (= (select (select (store .cse10 .cse11 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse10 .cse11 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 32) .cse12) (not (= (select v_arrayElimArr_56 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse12) .cse13) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_38)) (.cse15 (select v_arrayElimArr_38 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 .cse15 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_39) .cse15 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse14 (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse16 .cse15 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_60 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_61) .cse18 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_60) .cse18 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_61 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (bvule (bvadd (_ bv4 32) .cse17) .cse13))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_57)) (.cse20 (select v_arrayElimArr_57 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= (_ bv0 32) (select (select (store .cse19 .cse20 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_58 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_58) .cse20 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse13) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse19 .cse20 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_42)) (.cse21 (select v_arrayElimArr_42 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse22 (select (select (store .cse23 .cse21 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_43) .cse21 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse13) (not (= (_ bv0 32) (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse22 (_ bv0 32)) (= .cse22 (select (select (store .cse23 .cse21 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_59) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse24) .cse13) (= (_ bv0 32) .cse24) (not (= (select v_arrayElimArr_59 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_44 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_45) .cse27 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_44))) (or (= (bvadd (_ bv4 32) .cse25) (_ bv0 32)) (= (select (select (store .cse26 .cse27 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse25 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_45 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse26 .cse27 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((v_arrayElimArr_53 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_54) .cse28 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse13) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_53) .cse28 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_54 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_49 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select v_arrayElimArr_50 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_50) .cse30 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse29 (bvadd (_ bv4 32) .cse29))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_49))) (= (select (select (store .cse31 .cse30 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse31 .cse30 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-12-02 15:36:19,952 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_40)) (.cse2 (select v_arrayElimArr_40 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_41) .cse2 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select (store .cse1 .cse2 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_41 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse0 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse0) (_ bv0 32)) (= (select (select (store .cse1 .cse2 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse3) (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_46 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_46) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse4 (bvadd (_ bv4 32) .cse4))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_48 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_48) .cse5 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_47 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_47) .cse5 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse6 (bvadd (_ bv4 32) .cse6))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_51)) (.cse9 (select v_arrayElimArr_51 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 .cse9 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse7 (select (select (store .cse8 .cse9 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_52 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_52) .cse9 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse7 (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_arrayElimArr_55 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_56) .cse11 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_55))) (= (select (select (store .cse10 .cse11 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse10 .cse11 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 32) .cse12) (not (= (select v_arrayElimArr_56 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse12) .cse13) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_38)) (.cse15 (select v_arrayElimArr_38 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 .cse15 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_39 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (= .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_39) .cse15 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= .cse14 (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse16 .cse15 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select v_arrayElimArr_60 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_61) .cse18 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_60) .cse18 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 32) (select v_arrayElimArr_61 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (bvule (bvadd (_ bv4 32) .cse17) .cse13))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_57)) (.cse20 (select v_arrayElimArr_57 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= (_ bv0 32) (select (select (store .cse19 .cse20 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_58 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_58) .cse20 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse13) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= (select (select (store .cse19 .cse20 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_42)) (.cse21 (select v_arrayElimArr_42 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse22 (select (select (store .cse23 .cse21 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_43) .cse21 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse13) (not (= (_ bv0 32) (select v_arrayElimArr_43 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse22 (_ bv0 32)) (= .cse22 (select (select (store .cse23 .cse21 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_59) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse24) .cse13) (= (_ bv0 32) .cse24) (not (= (select v_arrayElimArr_59 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select v_arrayElimArr_44 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_45) .cse27 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_44))) (or (= (bvadd (_ bv4 32) .cse25) (_ bv0 32)) (= (select (select (store .cse26 .cse27 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse25 (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_45 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse26 .cse27 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))))))) (forall ((v_arrayElimArr_53 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select v_arrayElimArr_53 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_54) .cse28 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) .cse13) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_53) .cse28 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_54 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) (forall ((v_arrayElimArr_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (select v_arrayElimArr_49 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select v_arrayElimArr_50 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_50) .cse30 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse29 (bvadd (_ bv4 32) .cse29))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_49))) (= (select (select (store .cse31 .cse30 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse31 .cse30 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from true [2023-12-02 15:36:22,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (bvadd (_ bv4 32) .cse0)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_59) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_59 .cse0) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse1) .cse2) (= (_ bv0 32) .cse1) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_arrayElimArr_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_49 .cse0))) (or (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_49))) (= (select (select (store .cse4 .cse5 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse4 .cse5 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_50) .cse5 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse6 (bvadd .cse6 (_ bv4 32)))) (not (= (select v_arrayElimArr_50 .cse0) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_57)) (.cse7 (select v_arrayElimArr_57 .cse0))) (or (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_58) .cse7 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2) (not (= (select v_arrayElimArr_58 .cse0) (_ bv0 32))) (= (select (select (store .cse8 .cse7 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= .cse3 (select (select (store .cse8 .cse7 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_51)) (.cse10 (select v_arrayElimArr_51 .cse0))) (let ((.cse9 (select (select (store .cse11 .cse10 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_52 .cse0))) (= .cse3 .cse9) (= (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_52) .cse10 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse9 (_ bv0 32)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= .cse9 (select (select (store .cse11 .cse10 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_53 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_53 .cse0))) (or (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_54) .cse12 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_53) .cse12 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_54 .cse0) (_ bv0 32)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_60 .cse0))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_61) .cse14 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (_ bv0 32) .cse13) (bvule (bvadd (_ bv4 32) .cse13) .cse2) (not (= (_ bv0 32) (select v_arrayElimArr_61 .cse0))) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_60) .cse14 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_48 .cse0))) (or (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_47) .cse16 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse15 (bvadd (_ bv4 32) .cse15))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_48) .cse16 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_47 .cse0) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_55 .cse0))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_56) .cse19 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse17) .cse2) (not (= (_ bv0 32) (select v_arrayElimArr_56 .cse0))) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (= .cse17 (_ bv0 32)) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_55))) (= (select (select (store .cse18 .cse19 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse18 .cse19 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_42)) (.cse21 (select v_arrayElimArr_42 .cse0))) (let ((.cse20 (select (select (store .cse22 .cse21 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse20 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_43) .cse21 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2) (not (= (select v_arrayElimArr_43 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= .cse20 (select (select (store .cse22 .cse21 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_38)) (.cse23 (select v_arrayElimArr_38 .cse0))) (let ((.cse24 (select (select (store .cse25 .cse23 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_39) .cse23 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_arrayElimArr_39 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse24 (_ bv0 32)) (= .cse3 (select (select (store .cse25 .cse23 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= .cse3 .cse24))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_40)) (.cse29 (select v_arrayElimArr_40 .cse0))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_41) .cse29 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse27 (select (select (store .cse28 .cse29 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_41 .cse0))) (= .cse26 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse26) (_ bv0 32)) (= .cse3 .cse27) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (= .cse27 (select (select (store .cse28 .cse29 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_46) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse30 (bvadd .cse30 (_ bv4 32)))) (not (= (select v_arrayElimArr_46 .cse0) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_44 .cse0))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_45) .cse33 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse32 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_44))) (or (= .cse31 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse31) (_ bv0 32)) (= .cse3 (select (select (store .cse32 .cse33 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse3 (select (select (store .cse32 .cse33 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (not (= (select v_arrayElimArr_45 .cse0) (_ bv0 32)))))))))) is different from false [2023-12-02 15:36:24,991 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (bvadd (_ bv4 32) .cse0)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_59 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_59) |ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (select v_arrayElimArr_59 .cse0) (_ bv0 32))) (bvule (bvadd (_ bv4 32) .cse1) .cse2) (= (_ bv0 32) .cse1) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32))))))) (forall ((v_arrayElimArr_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_49 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_49 .cse0))) (or (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_49))) (= (select (select (store .cse4 .cse5 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse4 .cse5 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_50) .cse5 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse6 (bvadd .cse6 (_ bv4 32)))) (not (= (select v_arrayElimArr_50 .cse0) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_57 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_57)) (.cse7 (select v_arrayElimArr_57 .cse0))) (or (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_58) .cse7 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2) (not (= (select v_arrayElimArr_58 .cse0) (_ bv0 32))) (= (select (select (store .cse8 .cse7 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= .cse3 (select (select (store .cse8 .cse7 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32)))))) (forall ((v_arrayElimArr_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_51)) (.cse10 (select v_arrayElimArr_51 .cse0))) (let ((.cse9 (select (select (store .cse11 .cse10 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_52 .cse0))) (= .cse3 .cse9) (= (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_52) .cse10 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse9 (_ bv0 32)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= .cse9 (select (select (store .cse11 .cse10 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_53 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select v_arrayElimArr_53 .cse0))) (or (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_54) .cse12 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_53) .cse12 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_54 .cse0) (_ bv0 32)))))) (forall ((v_arrayElimArr_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_60 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select v_arrayElimArr_60 .cse0))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_61) .cse14 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (_ bv0 32) .cse13) (bvule (bvadd (_ bv4 32) .cse13) .cse2) (not (= (_ bv0 32) (select v_arrayElimArr_61 .cse0))) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_60) .cse14 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select v_arrayElimArr_48 .cse0))) (or (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_47) .cse16 v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse15 (bvadd (_ bv4 32) .cse15))) (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_48) .cse16 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_47 .cse0) (_ bv0 32)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_56 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (select v_arrayElimArr_55 .cse0))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_56) .cse19 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (bvule (bvadd (_ bv4 32) .cse17) .cse2) (not (= (_ bv0 32) (select v_arrayElimArr_56 .cse0))) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (= .cse17 (_ bv0 32)) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_55))) (= (select (select (store .cse18 .cse19 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select (store .cse18 .cse19 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimArr_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_42)) (.cse21 (select v_arrayElimArr_42 .cse0))) (let ((.cse20 (select (select (store .cse22 .cse21 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse20 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_43) .cse21 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2) (not (= (select v_arrayElimArr_43 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= .cse20 (select (select (store .cse22 .cse21 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_38)) (.cse23 (select v_arrayElimArr_38 .cse0))) (let ((.cse24 (select (select (store .cse25 .cse23 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_39) .cse23 v_prenex_23) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (not (= (select v_arrayElimArr_39 .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_36 (_ bv0 32)) (_ bv0 32))) (= .cse24 (_ bv0 32)) (= .cse3 (select (select (store .cse25 .cse23 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_23 (_ bv0 32)) (_ bv0 32))) (= .cse3 .cse24))))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_40)) (.cse29 (select v_arrayElimArr_40 .cse0))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_41) .cse29 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse27 (select (select (store .cse28 .cse29 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= (_ bv0 32) (select v_arrayElimArr_41 .cse0))) (= .cse26 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse26) (_ bv0 32)) (= .cse3 .cse27) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (= .cse27 (select (select (store .cse28 .cse29 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_#t~malloc3#1.base| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_37 (_ bv0 32)) (_ bv0 32))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_46) |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse30 (bvadd .cse30 (_ bv4 32)))) (not (= (select v_arrayElimArr_46 .cse0) (_ bv0 32))))) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_45 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select v_arrayElimArr_44 .cse0))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_45) .cse33 v_prenex_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse32 (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_44))) (or (= .cse31 (_ bv0 32)) (= (bvadd (_ bv4 32) .cse31) (_ bv0 32)) (= .cse3 (select (select (store .cse32 .cse33 v_arrayElimArr_36) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse3 (select (select (store .cse32 .cse33 v_prenex_24) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_prenex_24 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_prenex_25 (_ bv0 32)))) (not (= (select v_arrayElimArr_45 .cse0) (_ bv0 32)))))))))) is different from true [2023-12-02 15:36:25,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,120 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 1 case distinctions, treesize of input 51 treesize of output 43 [2023-12-02 15:36:25,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,159 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 1 case distinctions, treesize of input 43 treesize of output 36 [2023-12-02 15:36:25,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:25,194 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 23 treesize of output 19 [2023-12-02 15:36:25,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,250 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 610 treesize of output 569 [2023-12-02 15:36:25,262 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 [2023-12-02 15:36:25,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,301 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 30 treesize of output 32 [2023-12-02 15:36:25,311 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 16 [2023-12-02 15:36:25,405 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:36:25,405 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 21 treesize of output 18 [2023-12-02 15:36:25,447 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 [2023-12-02 15:36:25,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,501 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 1 case distinctions, treesize of input 49 treesize of output 41 [2023-12-02 15:36:25,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,541 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 1 case distinctions, treesize of input 67 treesize of output 51 [2023-12-02 15:36:25,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,660 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 715 treesize of output 666 [2023-12-02 15:36:25,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:25,710 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 21 treesize of output 17 [2023-12-02 15:36:25,759 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:36:25,759 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 19 treesize of output 16 [2023-12-02 15:36:25,778 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 [2023-12-02 15:36:25,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:25,827 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 89 treesize of output 87 [2023-12-02 15:36:25,842 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 64 treesize of output 54 [2023-12-02 15:36:25,860 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 30 treesize of output 26 [2023-12-02 15:36:25,987 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:36:25,987 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 1 case distinctions, treesize of input 43 treesize of output 1 [2023-12-02 15:36:25,993 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:36:26,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,021 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 1 case distinctions, treesize of input 45 treesize of output 38 [2023-12-02 15:36:26,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,063 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 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 15:36:26,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,183 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 86 treesize of output 85 [2023-12-02 15:36:26,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:36:26,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,308 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 30 treesize of output 33 [2023-12-02 15:36:26,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,409 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 45 treesize of output 47 [2023-12-02 15:36:26,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,480 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 24 treesize of output 26 [2023-12-02 15:36:26,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,781 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 1 case distinctions, treesize of input 41 treesize of output 34 [2023-12-02 15:36:26,876 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2023-12-02 15:36:26,876 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 158 treesize of output 142 [2023-12-02 15:36:26,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:26,939 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 20 treesize of output 22 [2023-12-02 15:36:27,018 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:36:27,018 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 1 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 15:36:27,056 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:36:27,057 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 1 case distinctions, treesize of input 47 treesize of output 1 [2023-12-02 15:36:27,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:27,097 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 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 15:36:27,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:27,137 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 1 case distinctions, treesize of input 70 treesize of output 54 [2023-12-02 15:36:27,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:27,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:36:27,163 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 16 treesize of output 12 [2023-12-02 15:36:27,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:27,261 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 384 treesize of output 367 [2023-12-02 15:36:27,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:27,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 15:36:27,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:27,330 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 15:36:27,357 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:36:27,358 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 1 case distinctions, treesize of input 51 treesize of output 1 [2023-12-02 15:36:27,398 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:36:27,406 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 15:36:27,432 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:36:27,433 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 1 case distinctions, treesize of input 49 treesize of output 1 [2023-12-02 15:36:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 15:36:34,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:36:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589468361] [2023-12-02 15:36:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589468361] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:36:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1167304319] [2023-12-02 15:36:34,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:36:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:36:34,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:36:34,494 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:36:34,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83bfcd5-86fa-4783-919a-6263fed1854f/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-12-02 15:36:34,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:36:34,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:36:34,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 15:36:34,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:34,791 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 7 [2023-12-02 15:36:34,926 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 [2023-12-02 15:36:35,071 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:36:35,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:36:35,482 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 15 treesize of output 1 [2023-12-02 15:36:35,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:36:36,282 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:36:36,283 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 44 treesize of output 33 [2023-12-02 15:36:36,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:36,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:36:36,500 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:36:36,500 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 16 treesize of output 15 [2023-12-02 15:36:36,599 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:36:36,600 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 44 treesize of output 33 [2023-12-02 15:36:37,103 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 15:36:37,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-02 15:36:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 15:36:37,623 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:36:37,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2023-12-02 15:36:37,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:36:37,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:36:38,633 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-12-02 15:36:38,633 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 3 case distinctions, treesize of input 65 treesize of output 48 [2023-12-02 15:36:38,782 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:36:38,782 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 16 treesize of output 15 [2023-12-02 15:36:39,223 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 15:36:39,224 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 15:36:39,241 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 32 treesize of output 11 [2023-12-02 15:36:40,479 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 15:36:40,480 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-12-02 15:36:40,494 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 [2023-12-02 15:36:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:40,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:41,853 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2023-12-02 15:36:41,936 WARN L854 $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|))) (and (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-12-02 15:36:42,016 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-12-02 15:36:44,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:44,610 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 33 treesize of output 37 [2023-12-02 15:36:44,680 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1174 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_76 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (let ((.cse0 (select v_arrayElimArr_76 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| .cse0 v_ArrVal_1167) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_76) .cse0 v_ArrVal_1174) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_46| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_46|) (_ bv0 1))) (forall ((v_ArrVal_1173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) |v_ULTIMATE.start_main_#t~malloc3#1.base_46| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))))) is different from false [2023-12-02 15:36:45,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:45,341 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 1 case distinctions, treesize of input 41 treesize of output 34 [2023-12-02 15:36:45,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:45,406 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 78 treesize of output 77 [2023-12-02 15:36:45,430 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 32 treesize of output 28 [2023-12-02 15:36:45,444 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 58 treesize of output 50 [2023-12-02 15:36:45,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:45,924 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 1 case distinctions, treesize of input 52 treesize of output 53 [2023-12-02 15:36:45,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:45,952 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 1 case distinctions, treesize of input 44 treesize of output 45 [2023-12-02 15:36:45,959 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:36:46,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:46,025 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 72 treesize of output 75 [2023-12-02 15:36:46,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:36:46,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:46,123 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 102 treesize of output 101 [2023-12-02 15:36:46,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:36:46,179 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 46 treesize of output 46 [2023-12-02 15:36:46,197 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 16 treesize of output 14 [2023-12-02 15:37:01,370 WARN L293 SmtUtils]: Spent 11.09s on a formula simplification that was a NOOP. DAG size: 513 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 15:37:01,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:37:01,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 1645 treesize of output 2556