./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/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_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/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_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:28:19,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:28:19,566 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 08:28:19,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:28:19,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:28:19,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:28:19,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:28:19,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:28:19,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:28:19,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:28:19,600 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:28:19,600 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:28:19,601 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:28:19,601 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:28:19,602 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:28:19,602 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:28:19,603 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:28:19,603 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:28:19,604 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:28:19,604 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:28:19,605 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:28:19,606 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:28:19,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 08:28:19,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 08:28:19,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:28:19,608 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:28:19,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:28:19,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:28:19,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:28:19,609 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 08:28:19,610 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 08:28:19,610 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 08:28:19,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:28:19,611 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:28:19,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 08:28:19,611 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:28:19,611 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:28:19,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:28:19,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:28:19,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:28:19,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:28:19,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:28:19,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:28:19,613 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:28:19,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:28:19,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:28:19,613 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:28:19,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:28:19,614 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_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/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_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2023-12-02 08:28:19,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:28:19,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:28:19,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:28:19,856 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:28:19,857 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:28:19,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-12-02 08:28:22,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:28:22,801 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:28:22,801 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-12-02 08:28:22,815 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/data/5b6ca516b/beb17c9e84e946a886cbf8e97ca6741d/FLAGc3b13bc8e [2023-12-02 08:28:22,826 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/data/5b6ca516b/beb17c9e84e946a886cbf8e97ca6741d [2023-12-02 08:28:22,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:28:22,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:28:22,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:28:22,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:28:22,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:28:22,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:22" (1/1) ... [2023-12-02 08:28:22,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74def435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:22, skipping insertion in model container [2023-12-02 08:28:22,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:28:22" (1/1) ... [2023-12-02 08:28:22,879 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:28:23,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:28:23,164 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:28:23,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:28:23,238 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:28:23,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23 WrapperNode [2023-12-02 08:28:23,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:28:23,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:28:23,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:28:23,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:28:23,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,288 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2023-12-02 08:28:23,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:28:23,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:28:23,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:28:23,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:28:23,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:28:23,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:28:23,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:28:23,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:28:23,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (1/1) ... [2023-12-02 08:28:23,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:28:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:28:23,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:28:23,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:28:23,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 08:28:23,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:28:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:28:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:28:23,507 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:28:23,509 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:28:23,870 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:28:23,924 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:28:23,924 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 08:28:23,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:28:23 BoogieIcfgContainer [2023-12-02 08:28:23,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:28:23,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:28:23,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:28:23,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:28:23,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:28:22" (1/3) ... [2023-12-02 08:28:23,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1f4be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:28:23, skipping insertion in model container [2023-12-02 08:28:23,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:28:23" (2/3) ... [2023-12-02 08:28:23,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1f4be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:28:23, skipping insertion in model container [2023-12-02 08:28:23,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:28:23" (3/3) ... [2023-12-02 08:28:23,936 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-12-02 08:28:23,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:28:23,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-12-02 08:28:23,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:28:24,003 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;@28aaf0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:28:24,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-12-02 08:28:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 61 states have (on average 2.442622950819672) internal successors, (149), 133 states have internal predecessors, (149), 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 08:28:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 08:28:24,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:24,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 08:28:24,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:24,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash 9056, now seen corresponding path program 1 times [2023-12-02 08:28:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138705451] [2023-12-02 08:28:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:24,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 08:28:24,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138705451] [2023-12-02 08:28:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138705451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:28:24,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929643690] [2023-12-02 08:28:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:24,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:24,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:24,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:24,253 INFO L87 Difference]: Start difference. First operand has 134 states, 61 states have (on average 2.442622950819672) internal successors, (149), 133 states have internal predecessors, (149), 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 08:28:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:24,429 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2023-12-02 08:28:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:28:24,431 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 08:28:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:24,441 INFO L225 Difference]: With dead ends: 131 [2023-12-02 08:28:24,442 INFO L226 Difference]: Without dead ends: 130 [2023-12-02 08:28:24,443 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 08:28:24,447 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 118 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:24,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 62 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-02 08:28:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2023-12-02 08:28:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 63 states have (on average 2.1746031746031744) internal successors, (137), 124 states have internal predecessors, (137), 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 08:28:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2023-12-02 08:28:24,491 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 2 [2023-12-02 08:28:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:24,491 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2023-12-02 08:28:24,491 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 08:28:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2023-12-02 08:28:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 08:28:24,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:24,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 08:28:24,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:28:24,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:24,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 9057, now seen corresponding path program 1 times [2023-12-02 08:28:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:24,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414920835] [2023-12-02 08:28:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:24,581 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 08:28:24,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414920835] [2023-12-02 08:28:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414920835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 08:28:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346824518] [2023-12-02 08:28:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:24,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:24,599 INFO L87 Difference]: Start difference. First operand 125 states and 137 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 08:28:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:24,729 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-12-02 08:28:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:28:24,730 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 08:28:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:24,731 INFO L225 Difference]: With dead ends: 119 [2023-12-02 08:28:24,731 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 08:28:24,732 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 08:28:24,733 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:24,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 77 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 08:28:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2023-12-02 08:28:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 63 states have (on average 2.0317460317460316) internal successors, (128), 115 states have internal predecessors, (128), 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 08:28:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-12-02 08:28:24,745 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 2 [2023-12-02 08:28:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:24,745 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-12-02 08:28:24,746 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 08:28:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-12-02 08:28:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 08:28:24,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:24,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:24,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:28:24,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:24,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1009143368, now seen corresponding path program 1 times [2023-12-02 08:28:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434741875] [2023-12-02 08:28:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:24,941 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 08:28:24,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434741875] [2023-12-02 08:28:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434741875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:24,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:24,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:24,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516134975] [2023-12-02 08:28:24,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:24,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:28:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:28:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:28:24,944 INFO L87 Difference]: Start difference. First operand 116 states and 128 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 08:28:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:25,165 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2023-12-02 08:28:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:25,166 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 08:28:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:25,168 INFO L225 Difference]: With dead ends: 154 [2023-12-02 08:28:25,168 INFO L226 Difference]: Without dead ends: 154 [2023-12-02 08:28:25,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:25,169 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 44 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:25,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 252 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-02 08:28:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2023-12-02 08:28:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 2.015873015873016) internal successors, (127), 114 states have internal predecessors, (127), 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 08:28:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-12-02 08:28:25,179 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 8 [2023-12-02 08:28:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:25,180 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-12-02 08:28:25,180 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 08:28:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-12-02 08:28:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 08:28:25,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:25,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:28:25,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:25,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1009143367, now seen corresponding path program 1 times [2023-12-02 08:28:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647651328] [2023-12-02 08:28:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:25,398 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 08:28:25,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647651328] [2023-12-02 08:28:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647651328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717809898] [2023-12-02 08:28:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:25,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:28:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:25,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:28:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:28:25,401 INFO L87 Difference]: Start difference. First operand 115 states and 127 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 08:28:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:25,587 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-12-02 08:28:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:25,587 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 08:28:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:25,588 INFO L225 Difference]: With dead ends: 114 [2023-12-02 08:28:25,589 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 08:28:25,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:25,590 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:25,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 08:28:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-02 08:28:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 2.0) internal successors, (126), 113 states have internal predecessors, (126), 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 08:28:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2023-12-02 08:28:25,599 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 8 [2023-12-02 08:28:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:25,599 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2023-12-02 08:28:25,599 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 08:28:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2023-12-02 08:28:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:28:25,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:25,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:25,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 08:28:25,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:25,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -273737594, now seen corresponding path program 1 times [2023-12-02 08:28:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730545190] [2023-12-02 08:28:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:25,685 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 08:28:25,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:25,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730545190] [2023-12-02 08:28:25,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730545190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:25,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:28:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164355083] [2023-12-02 08:28:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:25,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:28:25,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:25,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:28:25,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:25,688 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 08:28:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:25,839 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2023-12-02 08:28:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:28:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-12-02 08:28:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:25,840 INFO L225 Difference]: With dead ends: 112 [2023-12-02 08:28:25,840 INFO L226 Difference]: Without dead ends: 112 [2023-12-02 08:28:25,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 08:28:25,842 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:25,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 53 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-02 08:28:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2023-12-02 08:28:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.7941176470588236) internal successors, (122), 104 states have internal predecessors, (122), 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 08:28:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2023-12-02 08:28:25,849 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 11 [2023-12-02 08:28:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:25,849 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2023-12-02 08:28:25,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 08:28:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2023-12-02 08:28:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:28:25,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:25,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:25,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 08:28:25,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:25,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash -273737593, now seen corresponding path program 1 times [2023-12-02 08:28:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:25,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080097340] [2023-12-02 08:28:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:26,012 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 08:28:26,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080097340] [2023-12-02 08:28:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080097340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:26,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:26,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:28:26,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795567119] [2023-12-02 08:28:26,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:26,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:28:26,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:26,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:28:26,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:26,015 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:28:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:26,206 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2023-12-02 08:28:26,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:28:26,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-12-02 08:28:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:26,208 INFO L225 Difference]: With dead ends: 152 [2023-12-02 08:28:26,208 INFO L226 Difference]: Without dead ends: 152 [2023-12-02 08:28:26,208 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 08:28:26,209 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 154 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:26,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 90 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-02 08:28:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 130. [2023-12-02 08:28:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 129 states have internal predecessors, (157), 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 08:28:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 157 transitions. [2023-12-02 08:28:26,217 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 157 transitions. Word has length 11 [2023-12-02 08:28:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:26,217 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 157 transitions. [2023-12-02 08:28:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:28:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 157 transitions. [2023-12-02 08:28:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 08:28:26,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:26,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 08:28:26,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:26,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1068634324, now seen corresponding path program 1 times [2023-12-02 08:28:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:26,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223959640] [2023-12-02 08:28:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:26,333 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 08:28:26,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223959640] [2023-12-02 08:28:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223959640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708685829] [2023-12-02 08:28:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:26,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:28:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:26,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:28:26,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:28:26,335 INFO L87 Difference]: Start difference. First operand 130 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:28:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:26,485 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2023-12-02 08:28:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:26,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 08:28:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:26,487 INFO L225 Difference]: With dead ends: 129 [2023-12-02 08:28:26,487 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 08:28:26,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:26,488 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:26,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 230 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 08:28:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-12-02 08:28:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 128 states have internal predecessors, (155), 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 08:28:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2023-12-02 08:28:26,494 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 155 transitions. Word has length 13 [2023-12-02 08:28:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:26,494 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 155 transitions. [2023-12-02 08:28:26,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:28:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2023-12-02 08:28:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 08:28:26,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:26,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:26,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 08:28:26,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:26,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1068634323, now seen corresponding path program 1 times [2023-12-02 08:28:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:26,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350976914] [2023-12-02 08:28:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:26,672 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 08:28:26,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:26,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350976914] [2023-12-02 08:28:26,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350976914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:26,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:26,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451288556] [2023-12-02 08:28:26,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:26,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:28:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:26,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:28:26,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:28:26,674 INFO L87 Difference]: Start difference. First operand 129 states and 155 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:28:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:26,851 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2023-12-02 08:28:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 08:28:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:26,853 INFO L225 Difference]: With dead ends: 128 [2023-12-02 08:28:26,853 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 08:28:26,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:26,854 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:26,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 08:28:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-12-02 08:28:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 127 states have internal predecessors, (153), 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 08:28:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2023-12-02 08:28:26,859 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 13 [2023-12-02 08:28:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:26,860 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2023-12-02 08:28:26,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:28:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2023-12-02 08:28:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 08:28:26,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:26,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:26,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 08:28:26,861 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:26,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1226407054, now seen corresponding path program 1 times [2023-12-02 08:28:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152869312] [2023-12-02 08:28:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:26,909 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 08:28:26,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152869312] [2023-12-02 08:28:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152869312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:26,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:28:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682643711] [2023-12-02 08:28:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:26,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:28:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:28:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:26,912 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 08:28:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:27,035 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2023-12-02 08:28:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:28:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 08:28:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:27,039 INFO L225 Difference]: With dead ends: 145 [2023-12-02 08:28:27,039 INFO L226 Difference]: Without dead ends: 145 [2023-12-02 08:28:27,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:27,040 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 115 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:27,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-02 08:28:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 128. [2023-12-02 08:28:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 93 states have (on average 1.6236559139784945) internal successors, (151), 127 states have internal predecessors, (151), 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 08:28:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2023-12-02 08:28:27,044 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 14 [2023-12-02 08:28:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:27,044 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2023-12-02 08:28:27,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 08:28:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2023-12-02 08:28:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 08:28:27,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:27,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:27,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 08:28:27,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:27,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash -460212941, now seen corresponding path program 1 times [2023-12-02 08:28:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395134694] [2023-12-02 08:28:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:27,278 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 08:28:27,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395134694] [2023-12-02 08:28:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395134694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:28:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421308150] [2023-12-02 08:28:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:27,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 08:28:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 08:28:27,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:28:27,280 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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 08:28:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:27,539 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2023-12-02 08:28:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:28:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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 08:28:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:27,541 INFO L225 Difference]: With dead ends: 129 [2023-12-02 08:28:27,541 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 08:28:27,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 08:28:27,542 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 147 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:27,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 158 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 08:28:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2023-12-02 08:28:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.6129032258064515) internal successors, (150), 126 states have internal predecessors, (150), 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 08:28:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2023-12-02 08:28:27,545 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 15 [2023-12-02 08:28:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:27,546 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2023-12-02 08:28:27,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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 08:28:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2023-12-02 08:28:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 08:28:27,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:27,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:27,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 08:28:27,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:27,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash -460212940, now seen corresponding path program 1 times [2023-12-02 08:28:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081029319] [2023-12-02 08:28:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:27,813 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 08:28:27,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:27,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081029319] [2023-12-02 08:28:27,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081029319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:27,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:27,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:28:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711485205] [2023-12-02 08:28:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:27,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:28:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:27,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:28:27,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:28:27,815 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 08:28:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:28,239 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2023-12-02 08:28:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 08:28:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 08:28:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:28,240 INFO L225 Difference]: With dead ends: 119 [2023-12-02 08:28:28,240 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 08:28:28,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-02 08:28:28,241 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 138 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:28,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 195 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:28:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 08:28:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2023-12-02 08:28:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 109 states have internal predecessors, (132), 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 08:28:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2023-12-02 08:28:28,245 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 15 [2023-12-02 08:28:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:28,245 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2023-12-02 08:28:28,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 08:28:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2023-12-02 08:28:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 08:28:28,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:28,246 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 08:28:28,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 08:28:28,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:28,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1548028462, now seen corresponding path program 1 times [2023-12-02 08:28:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:28,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932739981] [2023-12-02 08:28:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:28,292 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 08:28:28,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:28,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932739981] [2023-12-02 08:28:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932739981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:28,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646918156] [2023-12-02 08:28:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:28,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:28:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:28:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:28,294 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 08:28:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:28,360 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2023-12-02 08:28:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:28,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 08:28:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:28,361 INFO L225 Difference]: With dead ends: 132 [2023-12-02 08:28:28,361 INFO L226 Difference]: Without dead ends: 132 [2023-12-02 08:28:28,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 08:28:28,362 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:28,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-02 08:28:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2023-12-02 08:28:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 113 states have internal predecessors, (136), 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 08:28:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2023-12-02 08:28:28,367 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 18 [2023-12-02 08:28:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:28,367 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2023-12-02 08:28:28,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 08:28:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2023-12-02 08:28:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 08:28:28,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:28,368 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 08:28:28,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 08:28:28,368 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:28,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 680428813, now seen corresponding path program 1 times [2023-12-02 08:28:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962329386] [2023-12-02 08:28:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:28,580 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 08:28:28,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962329386] [2023-12-02 08:28:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962329386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:28:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060551901] [2023-12-02 08:28:28,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:28,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 08:28:28,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:28,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 08:28:28,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:28:28,582 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 08:28:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:28,892 INFO L93 Difference]: Finished difference Result 203 states and 242 transitions. [2023-12-02 08:28:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:28:28,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 08:28:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:28,894 INFO L225 Difference]: With dead ends: 203 [2023-12-02 08:28:28,894 INFO L226 Difference]: Without dead ends: 203 [2023-12-02 08:28:28,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-02 08:28:28,895 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 183 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:28,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 206 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-02 08:28:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2023-12-02 08:28:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 125 states have internal predecessors, (152), 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 08:28:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2023-12-02 08:28:28,900 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 19 [2023-12-02 08:28:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:28,900 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2023-12-02 08:28:28,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 08:28:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2023-12-02 08:28:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 08:28:28,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:28,902 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 08:28:28,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 08:28:28,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:28,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash 680428814, now seen corresponding path program 1 times [2023-12-02 08:28:28,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431316096] [2023-12-02 08:28:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:29,104 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 08:28:29,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:29,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431316096] [2023-12-02 08:28:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431316096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:29,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:29,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:28:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473432135] [2023-12-02 08:28:29,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:29,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:28:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:28:29,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:28:29,106 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 08:28:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:29,420 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2023-12-02 08:28:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 08:28:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 08:28:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:29,421 INFO L225 Difference]: With dead ends: 188 [2023-12-02 08:28:29,422 INFO L226 Difference]: Without dead ends: 188 [2023-12-02 08:28:29,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-02 08:28:29,422 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 164 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:29,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 254 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-02 08:28:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2023-12-02 08:28:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 121 states have internal predecessors, (146), 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 08:28:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2023-12-02 08:28:29,427 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 19 [2023-12-02 08:28:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:29,428 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2023-12-02 08:28:29,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 08:28:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2023-12-02 08:28:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 08:28:29,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:29,429 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] [2023-12-02 08:28:29,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 08:28:29,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:29,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 179017512, now seen corresponding path program 1 times [2023-12-02 08:28:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41147464] [2023-12-02 08:28:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:29,628 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 08:28:29,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41147464] [2023-12-02 08:28:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41147464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:29,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:29,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:28:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690204753] [2023-12-02 08:28:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:29,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:28:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:28:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:28:29,630 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 08:28:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:30,125 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2023-12-02 08:28:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 08:28:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 20 [2023-12-02 08:28:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:30,127 INFO L225 Difference]: With dead ends: 260 [2023-12-02 08:28:30,127 INFO L226 Difference]: Without dead ends: 260 [2023-12-02 08:28:30,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2023-12-02 08:28:30,128 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 297 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:30,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 383 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:28:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-02 08:28:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 133. [2023-12-02 08:28:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 132 states have internal predecessors, (161), 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 08:28:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2023-12-02 08:28:30,133 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 20 [2023-12-02 08:28:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:30,133 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2023-12-02 08:28:30,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 08:28:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2023-12-02 08:28:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 08:28:30,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:30,134 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] [2023-12-02 08:28:30,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 08:28:30,134 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:30,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash 179017513, now seen corresponding path program 1 times [2023-12-02 08:28:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387292632] [2023-12-02 08:28:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:30,465 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 08:28:30,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:30,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387292632] [2023-12-02 08:28:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387292632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:28:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915708960] [2023-12-02 08:28:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:30,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:28:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:28:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:28:30,469 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 08:28:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:30,941 INFO L93 Difference]: Finished difference Result 201 states and 236 transitions. [2023-12-02 08:28:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 08:28:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 20 [2023-12-02 08:28:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:30,942 INFO L225 Difference]: With dead ends: 201 [2023-12-02 08:28:30,943 INFO L226 Difference]: Without dead ends: 201 [2023-12-02 08:28:30,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-12-02 08:28:30,944 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 291 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:30,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 337 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:28:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-02 08:28:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2023-12-02 08:28:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 132 states have internal predecessors, (160), 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 08:28:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2023-12-02 08:28:30,948 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 20 [2023-12-02 08:28:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:30,949 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2023-12-02 08:28:30,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 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 08:28:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2023-12-02 08:28:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 08:28:30,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:30,950 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] [2023-12-02 08:28:30,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 08:28:30,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:30,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1112470740, now seen corresponding path program 1 times [2023-12-02 08:28:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:30,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275165566] [2023-12-02 08:28:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:31,059 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 08:28:31,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275165566] [2023-12-02 08:28:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275165566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:31,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850431796] [2023-12-02 08:28:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:28:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:31,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:28:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:28:31,061 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 08:28:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:31,200 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2023-12-02 08:28:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2023-12-02 08:28:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:31,202 INFO L225 Difference]: With dead ends: 139 [2023-12-02 08:28:31,202 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 08:28:31,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:31,203 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:31,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 207 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 08:28:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2023-12-02 08:28:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 131 states have internal predecessors, (159), 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 08:28:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2023-12-02 08:28:31,207 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 159 transitions. Word has length 20 [2023-12-02 08:28:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:31,207 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 159 transitions. [2023-12-02 08:28:31,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 08:28:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2023-12-02 08:28:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 08:28:31,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:31,208 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] [2023-12-02 08:28:31,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 08:28:31,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:31,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1112470739, now seen corresponding path program 1 times [2023-12-02 08:28:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177436845] [2023-12-02 08:28:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:31,406 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 08:28:31,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:31,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177436845] [2023-12-02 08:28:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177436845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:31,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829681390] [2023-12-02 08:28:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:31,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:28:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:28:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:28:31,408 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 08:28:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:31,542 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2023-12-02 08:28:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2023-12-02 08:28:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:31,544 INFO L225 Difference]: With dead ends: 131 [2023-12-02 08:28:31,544 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 08:28:31,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:31,545 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:31,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 08:28:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-12-02 08:28:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.4363636363636363) internal successors, (158), 130 states have internal predecessors, (158), 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 08:28:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2023-12-02 08:28:31,549 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 20 [2023-12-02 08:28:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2023-12-02 08:28:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 08:28:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2023-12-02 08:28:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 08:28:31,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:31,550 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] [2023-12-02 08:28:31,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 08:28:31,550 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:31,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1775575368, now seen corresponding path program 1 times [2023-12-02 08:28:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:31,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163239329] [2023-12-02 08:28:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:31,574 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 08:28:31,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163239329] [2023-12-02 08:28:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163239329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:31,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:28:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597163181] [2023-12-02 08:28:31,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:31,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:28:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:28:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:28:31,576 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 08:28:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:31,619 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2023-12-02 08:28:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:28:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2023-12-02 08:28:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:31,620 INFO L225 Difference]: With dead ends: 133 [2023-12-02 08:28:31,620 INFO L226 Difference]: Without dead ends: 133 [2023-12-02 08:28:31,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:28:31,621 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:31,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:28:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-02 08:28:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-12-02 08:28:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 132 states have internal predecessors, (160), 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 08:28:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2023-12-02 08:28:31,625 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 21 [2023-12-02 08:28:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:31,625 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2023-12-02 08:28:31,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 08:28:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2023-12-02 08:28:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 08:28:31,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:31,626 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 08:28:31,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 08:28:31,626 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:31,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:31,627 INFO L85 PathProgramCache]: Analyzing trace with hash 795755568, now seen corresponding path program 1 times [2023-12-02 08:28:31,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:31,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747090283] [2023-12-02 08:28:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:31,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:31,747 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 08:28:31,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747090283] [2023-12-02 08:28:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747090283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:28:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689128324] [2023-12-02 08:28:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:31,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:28:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:31,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:28:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:31,749 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 08:28:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:31,972 INFO L93 Difference]: Finished difference Result 196 states and 230 transitions. [2023-12-02 08:28:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 08:28:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 08:28:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:31,974 INFO L225 Difference]: With dead ends: 196 [2023-12-02 08:28:31,974 INFO L226 Difference]: Without dead ends: 196 [2023-12-02 08:28:31,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-02 08:28:31,975 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 189 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:31,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 201 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-02 08:28:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 138. [2023-12-02 08:28:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 137 states have internal predecessors, (166), 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 08:28:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2023-12-02 08:28:31,980 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 22 [2023-12-02 08:28:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:31,980 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2023-12-02 08:28:31,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 08:28:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2023-12-02 08:28:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 08:28:31,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:31,981 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 08:28:31,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 08:28:31,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:31,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1147942965, now seen corresponding path program 1 times [2023-12-02 08:28:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054970592] [2023-12-02 08:28:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:32,191 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 08:28:32,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054970592] [2023-12-02 08:28:32,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054970592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:32,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:32,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 08:28:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373636158] [2023-12-02 08:28:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:32,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:28:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:28:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:28:32,193 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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 08:28:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:32,598 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2023-12-02 08:28:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 08:28:32,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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 08:28:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:32,599 INFO L225 Difference]: With dead ends: 204 [2023-12-02 08:28:32,600 INFO L226 Difference]: Without dead ends: 204 [2023-12-02 08:28:32,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-12-02 08:28:32,600 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 228 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:32,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 323 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:28:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-02 08:28:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2023-12-02 08:28:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 137 states have internal predecessors, (165), 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 08:28:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2023-12-02 08:28:32,605 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 23 [2023-12-02 08:28:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:32,605 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2023-12-02 08:28:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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 08:28:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2023-12-02 08:28:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 08:28:32,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:32,606 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:32,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 08:28:32,606 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:32,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1215386046, now seen corresponding path program 1 times [2023-12-02 08:28:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600237641] [2023-12-02 08:28:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:28:32,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600237641] [2023-12-02 08:28:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600237641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:28:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477986431] [2023-12-02 08:28:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:32,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:28:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:28:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:28:32,639 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 08:28:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:32,698 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2023-12-02 08:28:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:28:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 08:28:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:32,700 INFO L225 Difference]: With dead ends: 148 [2023-12-02 08:28:32,700 INFO L226 Difference]: Without dead ends: 148 [2023-12-02 08:28:32,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 08:28:32,701 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:32,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 199 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:28:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-02 08:28:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2023-12-02 08:28:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 141 states have internal predecessors, (168), 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 08:28:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 168 transitions. [2023-12-02 08:28:32,705 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 168 transitions. Word has length 23 [2023-12-02 08:28:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:32,705 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 168 transitions. [2023-12-02 08:28:32,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 08:28:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 168 transitions. [2023-12-02 08:28:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:28:32,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:32,706 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] [2023-12-02 08:28:32,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 08:28:32,706 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:32,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash -42875862, now seen corresponding path program 1 times [2023-12-02 08:28:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163027795] [2023-12-02 08:28:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:32,831 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 08:28:32,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163027795] [2023-12-02 08:28:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163027795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:28:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:28:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426762279] [2023-12-02 08:28:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:32,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:28:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:32,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:28:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:28:32,833 INFO L87 Difference]: Start difference. First operand 142 states and 168 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 08:28:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:28:33,037 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2023-12-02 08:28:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:28:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 08:28:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:28:33,039 INFO L225 Difference]: With dead ends: 175 [2023-12-02 08:28:33,039 INFO L226 Difference]: Without dead ends: 175 [2023-12-02 08:28:33,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:28:33,040 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:28:33,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:28:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-02 08:28:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 145. [2023-12-02 08:28:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 144 states have internal predecessors, (172), 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 08:28:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2023-12-02 08:28:33,043 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 24 [2023-12-02 08:28:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:28:33,044 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2023-12-02 08:28:33,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 08:28:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2023-12-02 08:28:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:28:33,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:28:33,044 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:28:33,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 08:28:33,045 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:28:33,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:28:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 227448250, now seen corresponding path program 1 times [2023-12-02 08:28:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:28:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443418734] [2023-12-02 08:28:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:28:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:33,238 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 08:28:33,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:28:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443418734] [2023-12-02 08:28:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443418734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:28:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128893802] [2023-12-02 08:28:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:28:33,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:28:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:28:33,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:28:33,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 08:28:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:28:33,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 08:28:33,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:28:33,432 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 08:28:33,439 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 08:28:33,466 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 08:28:33,473 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 08:28:33,499 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 08:28:33,506 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 08:28:33,518 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 08:28:33,528 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 08:28:33,706 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 08:28:33,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:28:34,221 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 10 treesize of output 8 [2023-12-02 08:28:34,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-12-02 08:28:34,235 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 10 treesize of output 8 [2023-12-02 08:28:34,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:28:34,249 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 08:28:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128893802] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:28:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012588155] [2023-12-02 08:28:34,266 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 08:28:34,266 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:28:34,269 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:28:34,274 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:28:34,274 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:28:35,092 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:28:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2012588155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:28:43,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:28:43,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 6, 5] total 26 [2023-12-02 08:28:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939857052] [2023-12-02 08:28:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:28:43,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 08:28:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:28:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 08:28:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=438, Unknown=15, NotChecked=0, Total=650 [2023-12-02 08:28:43,810 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 08:28:46,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:28:54,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:28:58,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:28:59,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:04,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:14,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:18,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:23,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:28,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:38,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:29:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:55,057 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2023-12-02 08:29:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 08:29:55,057 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 24 [2023-12-02 08:29:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:55,059 INFO L225 Difference]: With dead ends: 229 [2023-12-02 08:29:55,059 INFO L226 Difference]: Without dead ends: 229 [2023-12-02 08:29:55,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=311, Invalid=636, Unknown=45, NotChecked=0, Total=992 [2023-12-02 08:29:55,060 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 30 mSolverCounterUnsat, 84 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 84 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:55,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 193 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 477 Invalid, 84 Unknown, 0 Unchecked, 39.9s Time] [2023-12-02 08:29:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-02 08:29:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 173. [2023-12-02 08:29:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 172 states have internal predecessors, (204), 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 08:29:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2023-12-02 08:29:55,065 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 24 [2023-12-02 08:29:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:55,065 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2023-12-02 08:29:55,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 08:29:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2023-12-02 08:29:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 08:29:55,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:55,067 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, 1] [2023-12-02 08:29:55,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:29:55,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 08:29:55,268 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:29:55,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 81005459, now seen corresponding path program 1 times [2023-12-02 08:29:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:29:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128351192] [2023-12-02 08:29:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:29:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:55,812 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 08:29:55,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:29:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128351192] [2023-12-02 08:29:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128351192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:55,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:29:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 08:29:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58740416] [2023-12-02 08:29:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 08:29:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:29:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 08:29:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 08:29:55,814 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:29:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:56,597 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2023-12-02 08:29:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 08:29:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 08:29:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:56,599 INFO L225 Difference]: With dead ends: 241 [2023-12-02 08:29:56,599 INFO L226 Difference]: Without dead ends: 241 [2023-12-02 08:29:56,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2023-12-02 08:29:56,600 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 296 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:56,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 461 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 08:29:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-02 08:29:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 175. [2023-12-02 08:29:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 174 states have internal predecessors, (206), 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 08:29:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2023-12-02 08:29:56,605 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 26 [2023-12-02 08:29:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:56,606 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2023-12-02 08:29:56,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:29:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2023-12-02 08:29:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 08:29:56,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:56,607 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:56,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 08:29:56,607 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:29:56,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1756495668, now seen corresponding path program 1 times [2023-12-02 08:29:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:29:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14617179] [2023-12-02 08:29:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:29:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:56,958 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 08:29:56,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:29:56,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14617179] [2023-12-02 08:29:56,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14617179] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:29:56,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320359739] [2023-12-02 08:29:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:56,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:29:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:29:56,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:29:56,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 08:29:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:57,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:29:57,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 08:29:57,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:29:57,108 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 08:29:57,130 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 08:29:57,188 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:29:57,188 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 25 treesize of output 26 [2023-12-02 08:29:57,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:29:57,264 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 42 treesize of output 34 [2023-12-02 08:29:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:29:57,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:29:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320359739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:29:57,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:29:57,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2023-12-02 08:29:57,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670463491] [2023-12-02 08:29:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:29:57,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:29:57,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:29:57,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:29:57,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-12-02 08:29:57,381 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:29:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:29:57,788 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2023-12-02 08:29:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:29:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 08:29:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:29:57,789 INFO L225 Difference]: With dead ends: 222 [2023-12-02 08:29:57,789 INFO L226 Difference]: Without dead ends: 216 [2023-12-02 08:29:57,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-12-02 08:29:57,790 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 148 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:29:57,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 338 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:29:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-02 08:29:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 175. [2023-12-02 08:29:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 174 states have internal predecessors, (205), 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 08:29:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2023-12-02 08:29:57,795 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 205 transitions. Word has length 26 [2023-12-02 08:29:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:29:57,795 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 205 transitions. [2023-12-02 08:29:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:29:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2023-12-02 08:29:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 08:29:57,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:29:57,796 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:29:57,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 08:29:57,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 08:29:57,997 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:29:57,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:29:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1897802945, now seen corresponding path program 1 times [2023-12-02 08:29:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:29:57,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888983238] [2023-12-02 08:29:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:29:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:58,336 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 08:29:58,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:29:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888983238] [2023-12-02 08:29:58,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888983238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:29:58,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914881090] [2023-12-02 08:29:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:29:58,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:29:58,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:29:58,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:29:58,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 08:29:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:29:58,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 08:29:58,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:29:58,445 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 08:29:58,460 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 08:29:58,464 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 08:29:58,490 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 08:29:58,500 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 08:29:58,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:29:58,547 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 08:29:58,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 08:29:58,561 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 08:29:58,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-02 08:29:58,605 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 08:29:58,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:29:58,689 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 48 [2023-12-02 08:29:58,697 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 08:29:58,892 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 08:29:58,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:29:59,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:29:59,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2023-12-02 08:29:59,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:29:59,777 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 30 [2023-12-02 08:29:59,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 9 treesize of output 7 [2023-12-02 08:29:59,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:29:59,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2023-12-02 08:29:59,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:29:59,839 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 08:29:59,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 31 [2023-12-02 08:29:59,844 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 9 treesize of output 7 [2023-12-02 08:29:59,911 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 08:29:59,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914881090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:29:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963765618] [2023-12-02 08:29:59,913 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 08:29:59,913 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:29:59,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:29:59,914 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:29:59,914 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:30:01,171 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:30:29,019 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8571#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))' at error location [2023-12-02 08:30:29,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:30:29,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:30:29,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-12-02 08:30:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698401507] [2023-12-02 08:30:29,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:30:29,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 08:30:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 08:30:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1847, Unknown=26, NotChecked=0, Total=2162 [2023-12-02 08:30:29,022 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 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 08:30:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:31,826 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2023-12-02 08:30:31,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 08:30:31,827 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 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 27 [2023-12-02 08:30:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:31,828 INFO L225 Difference]: With dead ends: 212 [2023-12-02 08:30:31,828 INFO L226 Difference]: Without dead ends: 212 [2023-12-02 08:30:31,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=527, Invalid=3603, Unknown=30, NotChecked=0, Total=4160 [2023-12-02 08:30:31,829 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 302 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 43 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:31,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 641 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 932 Invalid, 17 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 08:30:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-02 08:30:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2023-12-02 08:30:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 185 states have internal predecessors, (221), 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 08:30:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2023-12-02 08:30:31,833 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 27 [2023-12-02 08:30:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:31,833 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2023-12-02 08:30:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 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 08:30:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2023-12-02 08:30:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 08:30:31,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:31,833 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, 1, 1, 1, 1] [2023-12-02 08:30:31,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 08:30:32,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 08:30:32,034 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:30:32,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -826545464, now seen corresponding path program 1 times [2023-12-02 08:30:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448471630] [2023-12-02 08:30:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:30:32,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448471630] [2023-12-02 08:30:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448471630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:32,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:30:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453514303] [2023-12-02 08:30:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:32,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:30:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:30:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:30:32,152 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 08:30:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:32,330 INFO L93 Difference]: Finished difference Result 211 states and 247 transitions. [2023-12-02 08:30:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:30:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2023-12-02 08:30:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:32,332 INFO L225 Difference]: With dead ends: 211 [2023-12-02 08:30:32,332 INFO L226 Difference]: Without dead ends: 211 [2023-12-02 08:30:32,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:30:32,333 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 172 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:32,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 191 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:30:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-02 08:30:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2023-12-02 08:30:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 187 states have internal predecessors, (223), 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 08:30:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 223 transitions. [2023-12-02 08:30:32,338 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 223 transitions. Word has length 29 [2023-12-02 08:30:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:32,338 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 223 transitions. [2023-12-02 08:30:32,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 08:30:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 223 transitions. [2023-12-02 08:30:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:30:32,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:32,339 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, 1, 1, 1, 1, 1] [2023-12-02 08:30:32,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-02 08:30:32,339 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:30:32,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash 146894648, now seen corresponding path program 1 times [2023-12-02 08:30:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:32,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651788274] [2023-12-02 08:30:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:32,557 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 08:30:32,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651788274] [2023-12-02 08:30:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651788274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032545270] [2023-12-02 08:30:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:32,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:32,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:32,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 08:30:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:32,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 08:30:32,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:32,700 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 08:30:32,725 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 08:30:32,877 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 08:30:32,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:34,017 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 20 treesize of output 18 [2023-12-02 08:30:34,022 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 08:30:34,042 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 08:30:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032545270] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:34,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:30:34,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 7] total 20 [2023-12-02 08:30:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742880839] [2023-12-02 08:30:34,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:30:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:30:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-02 08:30:34,044 INFO L87 Difference]: Start difference. First operand 188 states and 223 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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 08:30:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:34,400 INFO L93 Difference]: Finished difference Result 197 states and 231 transitions. [2023-12-02 08:30:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 08:30:34,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2023-12-02 08:30:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:34,401 INFO L225 Difference]: With dead ends: 197 [2023-12-02 08:30:34,401 INFO L226 Difference]: Without dead ends: 197 [2023-12-02 08:30:34,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2023-12-02 08:30:34,402 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 205 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:34,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 283 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:30:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-02 08:30:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-12-02 08:30:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.3333333333333333) internal successors, (220), 185 states have internal predecessors, (220), 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 08:30:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2023-12-02 08:30:34,406 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 30 [2023-12-02 08:30:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:34,406 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2023-12-02 08:30:34,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 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 08:30:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2023-12-02 08:30:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:30:34,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:34,407 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:34,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 08:30:34,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 08:30:34,607 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:30:34,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1967085807, now seen corresponding path program 1 times [2023-12-02 08:30:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:34,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133914381] [2023-12-02 08:30:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:30:35,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133914381] [2023-12-02 08:30:35,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133914381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:35,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287490271] [2023-12-02 08:30:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:35,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:35,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:35,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:35,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 08:30:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:35,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 08:30:35,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:35,375 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 08:30:35,397 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 08:30:35,402 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 08:30:35,493 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 08:30:35,494 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 08:30:35,556 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-02 08:30:35,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 1 case distinctions, treesize of input 23 treesize of output 15 [2023-12-02 08:30:35,573 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 08:30:35,574 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 19 treesize of output 18 [2023-12-02 08:30:35,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:30:35,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 54 [2023-12-02 08:30:35,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-02 08:30:35,901 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:30:35,902 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 74 treesize of output 57 [2023-12-02 08:30:35,915 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:30:35,916 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 81 treesize of output 74 [2023-12-02 08:30:36,053 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:30:36,053 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 74 treesize of output 57 [2023-12-02 08:30:36,067 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:30:36,067 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 81 treesize of output 74 [2023-12-02 08:30:36,127 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:30:36,128 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 74 treesize of output 57 [2023-12-02 08:30:36,140 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:30:36,141 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 81 treesize of output 74 [2023-12-02 08:30:36,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:36,458 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 59 treesize of output 59 [2023-12-02 08:30:36,671 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 08:30:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:30:36,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:37,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1162))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1167 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1161) .cse0 v_ArrVal_1167) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1168 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)))))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1162))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse3) 1) (= .cse3 |c_ULTIMATE.start_main_~head~0#1.base|)))))) is different from false [2023-12-02 08:30:37,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (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_1168 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1162))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1162))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse4 .cse5 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 1)) (forall ((v_ArrVal_1167 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1161) .cse5 v_ArrVal_1167) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-12-02 08:30:37,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1162))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 (select |c_#valid| .cse0)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1162))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store .cse4 .cse5 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (forall ((v_ArrVal_1167 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (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|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1161) .cse5 v_ArrVal_1167) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))))) is different from false [2023-12-02 08:30:37,656 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-12-02 08:30:37,656 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 2 case distinctions, treesize of input 48 treesize of output 61 [2023-12-02 08:30:37,687 INFO L349 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-12-02 08:30:37,687 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 2 case distinctions, treesize of input 89 treesize of output 68 [2023-12-02 08:30:37,701 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 08:30:37,702 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 368 treesize of output 246 [2023-12-02 08:30:37,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:37,721 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 53 treesize of output 53 [2023-12-02 08:30:37,729 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 18 treesize of output 14 [2023-12-02 08:30:37,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:37,744 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 61 treesize of output 59 [2023-12-02 08:30:37,751 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 08:30:37,763 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 7 [2023-12-02 08:30:37,810 INFO L349 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-12-02 08:30:37,810 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 2 case distinctions, treesize of input 102 treesize of output 68 [2023-12-02 08:30:37,818 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 08:30:37,819 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 271 treesize of output 185 [2023-12-02 08:30:37,835 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 24 [2023-12-02 08:30:37,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:37,843 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 57 treesize of output 51 [2023-12-02 08:30:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:30:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287490271] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:30:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624888410] [2023-12-02 08:30:38,018 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 08:30:38,018 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:30:38,019 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:30:38,019 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:30:38,019 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:30:44,634 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:31:05,565 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 271 DAG size of output: 260 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:31:21,525 WARN L293 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 295 DAG size of output: 282 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:31:45,803 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10239#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short19#1| |ULTIMATE.start_main_#t~short16#1| (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem15#1.offset|) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem17#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (not (= 1 (select |#valid| |ULTIMATE.start_main_#t~mem17#1.base|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))) (= 2 |ULTIMATE.start_main_#t~mem14#1|))' at error location [2023-12-02 08:31:45,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:31:45,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:31:45,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 36 [2023-12-02 08:31:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976808313] [2023-12-02 08:31:45,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:31:45,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:31:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:31:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:31:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3494, Unknown=44, NotChecked=372, Total=4290 [2023-12-02 08:31:45,806 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 37 states have internal predecessors, (84), 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 08:31:48,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1162))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 (select |c_#valid| .cse0)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1161 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1162))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store .cse4 .cse5 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (forall ((v_ArrVal_1167 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (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|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1161) .cse5 v_ArrVal_1167) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2023-12-02 08:32:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:09,731 INFO L93 Difference]: Finished difference Result 408 states and 465 transitions. [2023-12-02 08:32:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-02 08:32:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 37 states have internal predecessors, (84), 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 30 [2023-12-02 08:32:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:09,733 INFO L225 Difference]: With dead ends: 408 [2023-12-02 08:32:09,733 INFO L226 Difference]: Without dead ends: 408 [2023-12-02 08:32:09,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4072 ImplicationChecksByTransitivity, 79.9s TimeCoverageRelationStatistics Valid=1533, Invalid=10147, Unknown=108, NotChecked=868, Total=12656 [2023-12-02 08:32:09,737 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1050 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 186 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:09,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1115 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1830 Invalid, 53 Unknown, 1091 Unchecked, 6.4s Time] [2023-12-02 08:32:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-12-02 08:32:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 228. [2023-12-02 08:32:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 227 states have internal predecessors, (272), 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 08:32:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 272 transitions. [2023-12-02 08:32:09,741 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 272 transitions. Word has length 30 [2023-12-02 08:32:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:09,741 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 272 transitions. [2023-12-02 08:32:09,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 37 states have internal predecessors, (84), 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 08:32:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 272 transitions. [2023-12-02 08:32:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:32:09,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:09,742 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:09,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 08:32:09,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:09,943 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:32:09,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1549760500, now seen corresponding path program 1 times [2023-12-02 08:32:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267408260] [2023-12-02 08:32:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:10,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267408260] [2023-12-02 08:32:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267408260] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116279737] [2023-12-02 08:32:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:10,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:10,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:10,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:32:10,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 08:32:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:11,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 08:32:11,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:11,054 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 08:32:11,098 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 08:32:11,098 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 08:32:11,152 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 08:32:11,193 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:32:11,194 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 08:32:11,323 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-12-02 08:32:11,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-12-02 08:32:11,437 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-02 08:32:11,438 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 45 treesize of output 29 [2023-12-02 08:32:11,723 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:32:11,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 75 [2023-12-02 08:32:11,991 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:32:11,991 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 106 treesize of output 81 [2023-12-02 08:32:12,184 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:32:12,184 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 106 treesize of output 81 [2023-12-02 08:32:12,267 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:32:12,268 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 106 treesize of output 81 [2023-12-02 08:32:12,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:12,880 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 91 treesize of output 59 [2023-12-02 08:32:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:32:13,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:13,067 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1311 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1311) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-12-02 08:32:13,089 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1311 (Array Int Int))) (= (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_1311) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-12-02 08:32:13,099 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2023-12-02 08:32:13,281 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| Int) (v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| 1) (select (select (let ((.cse0 (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| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) 0)))) is different from false [2023-12-02 08:32:13,303 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| Int) (v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) 0)))) is different from false [2023-12-02 08:32:13,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1304 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| Int) (v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1304))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) 0)))) is different from false [2023-12-02 08:32:13,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:32:13,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:32:13,404 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 52 [2023-12-02 08:32:13,409 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 58 treesize of output 54 [2023-12-02 08:32:13,414 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 64 treesize of output 56 [2023-12-02 08:32:13,419 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 54 treesize of output 50 [2023-12-02 08:32:13,425 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 12 [2023-12-02 08:32:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 08:32:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116279737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:32:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298712863] [2023-12-02 08:32:13,637 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 08:32:13,637 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:32:13,637 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:32:13,637 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:32:13,637 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:32:20,659 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:32:58,168 WARN L293 SmtUtils]: Spent 11.90s on a formula simplification. DAG size of input: 298 DAG size of output: 279 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:33:37,591 WARN L293 SmtUtils]: Spent 15.14s on a formula simplification. DAG size of input: 322 DAG size of output: 301 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:34:25,140 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11213#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short19#1| |ULTIMATE.start_main_#t~short16#1| (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem15#1.offset|) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem17#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (not (= 1 (select |#valid| |ULTIMATE.start_main_#t~mem17#1.base|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))) (= 2 |ULTIMATE.start_main_#t~mem14#1|))' at error location [2023-12-02 08:34:25,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:34:25,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:34:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 34 [2023-12-02 08:34:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836634468] [2023-12-02 08:34:25,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:34:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 08:34:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 08:34:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3049, Unknown=52, NotChecked=714, Total=4160 [2023-12-02 08:34:25,144 INFO L87 Difference]: Start difference. First operand 228 states and 272 transitions. Second operand has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 states have internal predecessors, (79), 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 08:34:28,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8)) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse1)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1308))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1311)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1)) (= (select |c_#valid| (select .cse0 .cse1)) 1))) is different from false [2023-12-02 08:34:38,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:34:40,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:34:42,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:34:48,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:34:50,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:34:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:56,239 INFO L93 Difference]: Finished difference Result 593 states and 689 transitions. [2023-12-02 08:34:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 08:34:56,240 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 states have internal predecessors, (79), 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 31 [2023-12-02 08:34:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:56,243 INFO L225 Difference]: With dead ends: 593 [2023-12-02 08:34:56,243 INFO L226 Difference]: Without dead ends: 593 [2023-12-02 08:34:56,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 138.4s TimeCoverageRelationStatistics Valid=1002, Invalid=8278, Unknown=60, NotChecked=1372, Total=10712 [2023-12-02 08:34:56,247 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 605 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 84 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 5066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 2850 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:56,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1462 Invalid, 5066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2105 Invalid, 27 Unknown, 2850 Unchecked, 18.4s Time] [2023-12-02 08:34:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-12-02 08:34:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 252. [2023-12-02 08:34:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 251 states have internal predecessors, (302), 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 08:34:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2023-12-02 08:34:56,257 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 31 [2023-12-02 08:34:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:56,257 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2023-12-02 08:34:56,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 35 states have internal predecessors, (79), 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 08:34:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2023-12-02 08:34:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:34:56,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:56,259 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:56,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 08:34:56,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:56,462 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:34:56,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1549760501, now seen corresponding path program 1 times [2023-12-02 08:34:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852950886] [2023-12-02 08:34:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:58,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:58,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852950886] [2023-12-02 08:34:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852950886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989613286] [2023-12-02 08:34:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:58,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:34:58,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 08:34:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:59,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 08:34:59,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:59,086 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 08:34:59,233 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 08:34:59,322 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 08:34:59,323 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 08:34:59,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:34:59,564 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 08:34:59,963 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:34:59,963 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 59 treesize of output 52 [2023-12-02 08:34:59,982 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 08:35:00,375 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 08:35:00,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 08:35:00,472 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-02 08:35:00,473 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 20 treesize of output 22 [2023-12-02 08:35:00,765 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-02 08:35:00,766 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 45 treesize of output 29 [2023-12-02 08:35:00,894 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 08:35:00,895 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 19 treesize of output 18 [2023-12-02 08:35:01,599 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:35:01,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 87 [2023-12-02 08:35:01,682 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-02 08:35:02,316 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:35:02,316 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 113 treesize of output 88 [2023-12-02 08:35:02,365 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:35:02,366 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 120 treesize of output 113 [2023-12-02 08:35:02,856 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:35:02,857 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 113 treesize of output 88 [2023-12-02 08:35:02,905 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:35:02,905 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 120 treesize of output 113 [2023-12-02 08:35:03,117 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:35:03,117 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 113 treesize of output 88 [2023-12-02 08:35:03,167 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:35:03,167 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 120 treesize of output 113 [2023-12-02 08:35:04,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:04,891 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 98 treesize of output 66 [2023-12-02 08:35:04,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:04,930 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 62 treesize of output 62 [2023-12-02 08:35:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:35:05,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:35:06,125 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|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1463) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2023-12-02 08:35:06,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1457))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1456) .cse0 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1463) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1456) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-12-02 08:35:06,205 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.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_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1456) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1457) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1457))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1456) .cse2 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1463) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) is different from false [2023-12-02 08:35:06,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1456) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1456) .cse3 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1463) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) is different from false [2023-12-02 08:35:12,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:35:12,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:12,612 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 104 treesize of output 104 [2023-12-02 08:35:12,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:35:12,632 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 48 treesize of output 44 [2023-12-02 08:35:12,644 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 54 treesize of output 46 [2023-12-02 08:35:12,657 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 08:35:12,671 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 7 [2023-12-02 08:35:12,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:35:12,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:12,788 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 252 treesize of output 252 [2023-12-02 08:35:12,795 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 08:35:12,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:12,815 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 90 treesize of output 80 [2023-12-02 08:35:12,830 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 144 treesize of output 138 [2023-12-02 08:35:12,857 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 146 treesize of output 140 [2023-12-02 08:35:12,875 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 167 treesize of output 155 [2023-12-02 08:35:12,893 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 190 treesize of output 182 [2023-12-02 08:35:12,919 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 126 treesize of output 118 [2023-12-02 08:35:12,947 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 110 treesize of output 98 [2023-12-02 08:35:12,966 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 84 treesize of output 68 [2023-12-02 08:35:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:35:16,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989613286] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:35:16,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276792764] [2023-12-02 08:35:16,340 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 08:35:16,340 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:35:16,340 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:35:16,341 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:35:16,341 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:35:24,178 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:36:25,485 WARN L293 SmtUtils]: Spent 19.58s on a formula simplification. DAG size of input: 298 DAG size of output: 279 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:37:17,607 WARN L293 SmtUtils]: Spent 21.05s on a formula simplification. DAG size of input: 322 DAG size of output: 301 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:38:16,007 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12393#(and (<= 0 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~short19#1| |ULTIMATE.start_main_#t~short16#1| (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem15#1.offset|) (<= (+ 16 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) |ULTIMATE.start_main_#t~mem17#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (or (< (select |#length| |ULTIMATE.start_main_#t~mem17#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem17#1.offset|)) (< |ULTIMATE.start_main_#t~mem17#1.offset| 0)) (or (not (= |ULTIMATE.start_main_#t~mem15#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_#t~mem15#1.offset|))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))) (= 2 |ULTIMATE.start_main_#t~mem14#1|))' at error location [2023-12-02 08:38:16,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:38:16,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:38:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 40 [2023-12-02 08:38:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757232115] [2023-12-02 08:38:16,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:38:16,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 08:38:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:38:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 08:38:16,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=3998, Unknown=44, NotChecked=532, Total=4970 [2023-12-02 08:38:16,011 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 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 08:38:20,893 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (select .cse6 .cse1)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (<= (+ .cse0 4) (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1456) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 0 .cse0) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1456) .cse4 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1463) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (= (select .cse6 0) 0)))) is different from false [2023-12-02 08:38:23,312 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select .cse1 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (= (select |c_#length| .cse5) 16)) (.cse9 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1456) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= (select |c_#length| .cse3) 16) (not (= .cse3 |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (let ((.cse4 (not (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|)))) (or (and .cse4 (exists ((v_arrayElimCell_91 Int)) (and (not (= v_arrayElimCell_91 |c_ULTIMATE.start_main_~x~0#1.base|)) (= 16 (select |c_#length| v_arrayElimCell_91)) (not (= .cse5 v_arrayElimCell_91)))) .cse6) (and .cse4 (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_123| Int)) (let ((.cse7 (select .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_123|))) (and (= (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_123|) 0) (not (= .cse7 .cse5)) (not (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|)) (= 16 (select |c_#length| .cse7))))) .cse6))) (= (select .cse8 8) 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= .cse9 0) (not (= .cse3 |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#length| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 16) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1457))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1456) .cse10 v_ArrVal_1462) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1463) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (= (select .cse8 0) 0) .cse6 (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| .cse9) (= (select |c_#valid| .cse5) 1))))) is different from false [2023-12-02 08:38:52,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:38:54,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:38:57,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:38:59,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:39:01,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:39:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:39:24,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:39:26,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:39:28,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:39:30,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:39:32,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:39:35,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:39:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:39:48,545 INFO L93 Difference]: Finished difference Result 670 states and 774 transitions. [2023-12-02 08:39:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 08:39:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 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 31 [2023-12-02 08:39:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:39:48,550 INFO L225 Difference]: With dead ends: 670 [2023-12-02 08:39:48,550 INFO L226 Difference]: Without dead ends: 670 [2023-12-02 08:39:48,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4219 ImplicationChecksByTransitivity, 230.9s TimeCoverageRelationStatistics Valid=1172, Invalid=10493, Unknown=131, NotChecked=1314, Total=13110 [2023-12-02 08:39:48,555 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1485 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 171 mSolverCounterUnsat, 142 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 4824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 142 IncrementalHoareTripleChecker+Unknown, 2254 IncrementalHoareTripleChecker+Unchecked, 46.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:39:48,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1648 Invalid, 4824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2257 Invalid, 142 Unknown, 2254 Unchecked, 46.3s Time] [2023-12-02 08:39:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2023-12-02 08:39:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 274. [2023-12-02 08:39:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 253 states have (on average 1.3043478260869565) internal successors, (330), 273 states have internal predecessors, (330), 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 08:39:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 330 transitions. [2023-12-02 08:39:48,565 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 330 transitions. Word has length 31 [2023-12-02 08:39:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:39:48,565 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 330 transitions. [2023-12-02 08:39:48,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 41 states have internal predecessors, (93), 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 08:39:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 330 transitions. [2023-12-02 08:39:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 08:39:48,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:39:48,566 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:39:48,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 08:39:48,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-02 08:39:48,767 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-12-02 08:39:48,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:39:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1327408117, now seen corresponding path program 1 times [2023-12-02 08:39:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:39:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033174182] [2023-12-02 08:39:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:39:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:39:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:39:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:39:52,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:39:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033174182] [2023-12-02 08:39:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033174182] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:39:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275228439] [2023-12-02 08:39:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:39:52,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:39:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:39:52,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:39:52,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db61faa-b4f4-4e0f-9a28-cf099faf74f7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 08:39:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:39:52,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 08:39:52,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:39:52,173 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 08:39:52,472 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 08:39:52,497 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 08:39:53,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:39:53,094 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 08:39:53,536 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 08:39:53,537 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 19 treesize of output 18 [2023-12-02 08:39:53,707 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-02 08:39:53,707 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 23 treesize of output 15 [2023-12-02 08:39:54,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:39:54,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 47 [2023-12-02 08:39:54,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-02 08:39:55,340 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:39:55,341 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 56 treesize of output 43 [2023-12-02 08:39:55,414 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:39:55,414 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 63 treesize of output 56 [2023-12-02 08:39:55,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:39:55,675 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 08:39:55,774 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:39:55,775 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 56 treesize of output 43 [2023-12-02 08:39:55,844 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:39:55,844 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 63 treesize of output 56 [2023-12-02 08:39:56,476 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-12-02 08:39:56,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 42 [2023-12-02 08:39:56,565 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:39:56,565 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 63 treesize of output 56 [2023-12-02 08:39:57,973 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2023-12-02 08:39:57,974 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 113 [2023-12-02 08:39:58,067 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 08:39:58,067 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 97 treesize of output 90 [2023-12-02 08:39:58,911 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 7 [2023-12-02 08:39:58,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:39:59,105 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 7 [2023-12-02 08:40:04,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:04,769 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 433 treesize of output 465 [2023-12-02 08:40:27,558 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-12-02 08:40:27,559 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 210 [2023-12-02 08:40:29,205 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 18 treesize of output 10 [2023-12-02 08:40:29,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:29,361 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 18 treesize of output 10 [2023-12-02 08:40:29,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:29,874 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 18 treesize of output 10 [2023-12-02 08:40:30,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:30,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:30,286 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 18 treesize of output 10 [2023-12-02 08:40:30,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 08:40:30,623 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 18 treesize of output 10 [2023-12-02 08:40:30,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 08:40:30,912 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 18 treesize of output 10 [2023-12-02 08:40:30,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:34,469 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 08:40:34,741 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 08:40:34,828 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 08:40:35,001 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 08:40:35,027 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 08:40:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:35,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:35,254 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 18 treesize of output 10 [2023-12-02 08:40:35,392 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 08:40:35,705 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 18 treesize of output 10 [2023-12-02 08:40:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:36,358 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 08:40:36,410 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 08:40:40,162 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 13 treesize of output 9 [2023-12-02 08:40:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:40:40,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:40:42,165 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1612 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) 1))) (forall ((v_ArrVal_1613 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse1) 1)))))) is different from false [2023-12-02 08:40:42,237 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| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1612 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1613 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) 1))) (forall ((v_ArrVal_1613 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse2) 1) (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|)))))) is different from false [2023-12-02 08:40:42,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:42,375 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 95 treesize of output 151 [2023-12-02 08:40:43,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse6 (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1611 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_prenex_354 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_354) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1613 (Array Int Int))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|))))))) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1613 (Array Int Int)) (v_prenex_354 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_354) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse5 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) .cse4))))) .cse6) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1613 (Array Int Int)) (v_prenex_354 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (or (= (select (select (store .cse7 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_354) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse7 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse6) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_prenex_354 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_354) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1613 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse9 .cse8) (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse9 |c_ULTIMATE.start_main_~head~0#1.base|)))))))) (or .cse6 (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1613 (Array Int Int)) (v_prenex_354 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_354) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse12 .cse11) (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1613 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1613) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (forall ((v_prenex_354 (Array Int Int))) (= .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_354) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (= .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse14 |c_ULTIMATE.start_main_~head~0#1.base|)))))))) is different from false [2023-12-02 08:40:45,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:40:45,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 460 treesize of output 734 [2023-12-02 08:41:06,703 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-02 08:41:06,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 154 treesize of output 163 [2023-12-02 08:41:07,165 INFO L349 Elim1Store]: treesize reduction 42, result has 59.2 percent of original size [2023-12-02 08:41:07,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 264 treesize of output 306 [2023-12-02 08:41:07,781 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 08:41:07,782 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 25 treesize of output 17 [2023-12-02 08:41:07,912 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 08:41:07,912 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 25 treesize of output 17 [2023-12-02 08:41:07,968 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 08:41:08,060 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 08:41:08,304 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 08:41:08,304 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 25 treesize of output 17 [2023-12-02 08:41:08,392 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 08:41:08,392 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 25 treesize of output 17 [2023-12-02 08:41:08,725 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2023-12-02 08:41:08,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 31 [2023-12-02 08:41:08,894 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2023-12-02 08:41:08,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 31 [2023-12-02 08:41:09,286 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 08:41:09,286 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-02 08:41:11,048 INFO L349 Elim1Store]: treesize reduction 384, result has 20.7 percent of original size [2023-12-02 08:41:11,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 1470 treesize of output 1246