./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-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_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/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_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/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_629c2cc7-085b-44e4-abd9-778cf68741ff/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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:21:17,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:21:17,466 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:21:17,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:21:17,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:21:17,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:21:17,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:21:17,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:21:17,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:21:17,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:21:17,499 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:21:17,500 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:21:17,500 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:21:17,501 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:21:17,501 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:21:17,502 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:21:17,502 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:21:17,503 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:21:17,503 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:21:17,504 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:21:17,504 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:21:17,507 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:21:17,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:21:17,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:21:17,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:21:17,510 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:21:17,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:21:17,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:21:17,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:21:17,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:21:17,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:21:17,519 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:21:17,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:21:17,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:21:17,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:21:17,521 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:21:17,521 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:21:17,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:21:17,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:21:17,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:21:17,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:17,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:21:17,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:21:17,523 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:21:17,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:21:17,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:21:17,523 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:21:17,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:21:17,524 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_629c2cc7-085b-44e4-abd9-778cf68741ff/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_629c2cc7-085b-44e4-abd9-778cf68741ff/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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2023-12-02 15:21:17,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:21:17,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:21:17,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:21:17,757 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:21:17,757 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:21:17,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-12-02 15:21:20,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:21:20,755 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:21:20,756 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-12-02 15:21:20,770 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/data/d717e285e/e3fd6335e924470c936ebccf5f0d221e/FLAGe0af72d4e [2023-12-02 15:21:20,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/data/d717e285e/e3fd6335e924470c936ebccf5f0d221e [2023-12-02 15:21:20,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:21:20,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:21:20,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:20,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:21:20,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:21:20,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:20" (1/1) ... [2023-12-02 15:21:20,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2326088e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:20, skipping insertion in model container [2023-12-02 15:21:20,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:20" (1/1) ... [2023-12-02 15:21:20,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:21,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:21,100 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:21:21,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:21,172 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:21:21,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21 WrapperNode [2023-12-02 15:21:21,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:21,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:21,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:21:21,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:21:21,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,215 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2023-12-02 15:21:21,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:21,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:21:21,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:21:21,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:21:21,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:21:21,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:21:21,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:21:21,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:21:21,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (1/1) ... [2023-12-02 15:21:21,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:21,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:21:21,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:21:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 15:21:21,304 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 15:21:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:21:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:21:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:21:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:21:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:21:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:21:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:21:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:21:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:21:21,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:21:21,408 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:21:21,410 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:21:21,749 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:21:21,790 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:21:21,791 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-12-02 15:21:21,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:21 BoogieIcfgContainer [2023-12-02 15:21:21,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:21:21,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:21:21,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:21:21,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:21:21,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:21:20" (1/3) ... [2023-12-02 15:21:21,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c399b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:21, skipping insertion in model container [2023-12-02 15:21:21,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:21" (2/3) ... [2023-12-02 15:21:21,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c399b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:21, skipping insertion in model container [2023-12-02 15:21:21,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:21" (3/3) ... [2023-12-02 15:21:21,802 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-12-02 15:21:21,821 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:21:21,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-12-02 15:21:21,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:21:21,871 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;@9fb486a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:21:21,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-12-02 15:21:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 15:21:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:21:21,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:21,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:21:21,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:21,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 9685, now seen corresponding path program 1 times [2023-12-02 15:21:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:21,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645901530] [2023-12-02 15:21:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:22,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645901530] [2023-12-02 15:21:22,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645901530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:22,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:22,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:21:22,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889901284] [2023-12-02 15:21:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:22,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:22,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:22,120 INFO L87 Difference]: Start difference. First operand has 128 states, 61 states have (on average 2.377049180327869) internal successors, (145), 120 states have internal predecessors, (145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:22,268 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-12-02 15:21:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:22,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 15:21:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:22,280 INFO L225 Difference]: With dead ends: 136 [2023-12-02 15:21:22,280 INFO L226 Difference]: Without dead ends: 135 [2023-12-02 15:21:22,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:22,286 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:22,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-02 15:21:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2023-12-02 15:21:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 114 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2023-12-02 15:21:22,327 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2023-12-02 15:21:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:22,327 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2023-12-02 15:21:22,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2023-12-02 15:21:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:21:22,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:22,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:21:22,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:21:22,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:22,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 9686, now seen corresponding path program 1 times [2023-12-02 15:21:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662586757] [2023-12-02 15:21:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:22,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662586757] [2023-12-02 15:21:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662586757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:21:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711318047] [2023-12-02 15:21:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:22,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:21:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:21:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:22,425 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:22,535 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2023-12-02 15:21:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:21:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 15:21:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:22,538 INFO L225 Difference]: With dead ends: 118 [2023-12-02 15:21:22,538 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 15:21:22,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:21:22,540 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:22,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 169 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 15:21:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2023-12-02 15:21:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 54 states have (on average 2.111111111111111) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2023-12-02 15:21:22,553 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 2 [2023-12-02 15:21:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:22,553 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2023-12-02 15:21:22,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2023-12-02 15:21:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 15:21:22,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:22,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:22,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:21:22,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:22,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866331, now seen corresponding path program 1 times [2023-12-02 15:21:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019487804] [2023-12-02 15:21:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:22,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019487804] [2023-12-02 15:21:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019487804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:22,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:21:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81828560] [2023-12-02 15:21:22,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:22,658 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:22,829 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-12-02 15:21:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-02 15:21:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:22,831 INFO L225 Difference]: With dead ends: 116 [2023-12-02 15:21:22,831 INFO L226 Difference]: Without dead ends: 116 [2023-12-02 15:21:22,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:22,833 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:22,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-02 15:21:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2023-12-02 15:21:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 98 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-12-02 15:21:22,842 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 7 [2023-12-02 15:21:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:22,842 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-12-02 15:21:22,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-12-02 15:21:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 15:21:22,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:22,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:21:22,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:22,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866330, now seen corresponding path program 1 times [2023-12-02 15:21:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:22,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67479332] [2023-12-02 15:21:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:22,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67479332] [2023-12-02 15:21:22,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67479332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752120371] [2023-12-02 15:21:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:22,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:22,994 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:23,158 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-12-02 15:21:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:23,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-02 15:21:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:23,160 INFO L225 Difference]: With dead ends: 112 [2023-12-02 15:21:23,160 INFO L226 Difference]: Without dead ends: 112 [2023-12-02 15:21:23,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:23,162 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:23,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-02 15:21:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2023-12-02 15:21:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 105 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-12-02 15:21:23,171 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 7 [2023-12-02 15:21:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:23,171 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-12-02 15:21:23,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-12-02 15:21:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 15:21:23,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:23,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:23,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:21:23,172 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:23,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1905866307, now seen corresponding path program 1 times [2023-12-02 15:21:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425539156] [2023-12-02 15:21:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:23,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425539156] [2023-12-02 15:21:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425539156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:23,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:23,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118523266] [2023-12-02 15:21:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:21:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:21:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:21:23,405 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:23,675 INFO L93 Difference]: Finished difference Result 180 states and 193 transitions. [2023-12-02 15:21:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:21:23,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-02 15:21:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:23,677 INFO L225 Difference]: With dead ends: 180 [2023-12-02 15:21:23,677 INFO L226 Difference]: Without dead ends: 180 [2023-12-02 15:21:23,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:21:23,679 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 230 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:23,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 93 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-02 15:21:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2023-12-02 15:21:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.670731707317073) internal successors, (137), 124 states have internal predecessors, (137), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2023-12-02 15:21:23,688 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 7 [2023-12-02 15:21:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:23,688 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2023-12-02 15:21:23,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2023-12-02 15:21:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:21:23,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:23,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:23,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:21:23,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:23,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222096, now seen corresponding path program 1 times [2023-12-02 15:21:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455943910] [2023-12-02 15:21:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:23,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:23,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455943910] [2023-12-02 15:21:23,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455943910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:23,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:23,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104026021] [2023-12-02 15:21:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:23,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:23,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:23,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:23,793 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:23,949 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2023-12-02 15:21:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-12-02 15:21:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:23,952 INFO L225 Difference]: With dead ends: 125 [2023-12-02 15:21:23,952 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 15:21:23,952 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 15:21:23,953 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:23,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 15:21:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-12-02 15:21:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.646341463414634) internal successors, (135), 123 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2023-12-02 15:21:23,961 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 9 [2023-12-02 15:21:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:23,961 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-12-02 15:21:23,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2023-12-02 15:21:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:21:23,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:23,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:23,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:21:23,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:23,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1881222095, now seen corresponding path program 1 times [2023-12-02 15:21:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343644585] [2023-12-02 15:21:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:24,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343644585] [2023-12-02 15:21:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343644585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278991408] [2023-12-02 15:21:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:24,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:24,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:24,133 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:24,290 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2023-12-02 15:21:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-12-02 15:21:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:24,291 INFO L225 Difference]: With dead ends: 124 [2023-12-02 15:21:24,292 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 15:21:24,292 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 15:21:24,293 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:24,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 15:21:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-12-02 15:21:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 122 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2023-12-02 15:21:24,300 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 9 [2023-12-02 15:21:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:24,300 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2023-12-02 15:21:24,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2023-12-02 15:21:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 15:21:24,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:24,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:24,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:21:24,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:24,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224648, now seen corresponding path program 1 times [2023-12-02 15:21:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390553528] [2023-12-02 15:21:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:24,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390553528] [2023-12-02 15:21:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390553528] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:24,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58299894] [2023-12-02 15:21:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:24,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:24,406 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:24,535 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-12-02 15:21:24,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:24,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-02 15:21:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:24,537 INFO L225 Difference]: With dead ends: 123 [2023-12-02 15:21:24,537 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 15:21:24,537 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 15:21:24,538 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:24,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 15:21:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-12-02 15:21:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 121 states have internal predecessors, (131), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2023-12-02 15:21:24,543 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 10 [2023-12-02 15:21:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:24,544 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2023-12-02 15:21:24,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2023-12-02 15:21:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 15:21:24,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:24,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:24,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:21:24,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:24,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1810224649, now seen corresponding path program 1 times [2023-12-02 15:21:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175145367] [2023-12-02 15:21:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:24,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:24,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175145367] [2023-12-02 15:21:24,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175145367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:24,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:24,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:24,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106126111] [2023-12-02 15:21:24,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:24,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:24,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:24,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:24,789 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:24,934 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-12-02 15:21:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-12-02 15:21:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:24,936 INFO L225 Difference]: With dead ends: 122 [2023-12-02 15:21:24,936 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 15:21:24,937 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 15:21:24,937 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:24,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 15:21:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-12-02 15:21:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 120 states have internal predecessors, (129), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2023-12-02 15:21:24,942 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 10 [2023-12-02 15:21:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:24,942 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2023-12-02 15:21:24,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2023-12-02 15:21:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:21:24,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:24,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:24,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:21:24,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:24,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 327030838, now seen corresponding path program 1 times [2023-12-02 15:21:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:24,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876311430] [2023-12-02 15:21:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:25,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876311430] [2023-12-02 15:21:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876311430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:21:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575495436] [2023-12-02 15:21:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:25,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:21:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:21:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:21:25,131 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 15:21:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:25,419 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-12-02 15:21:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:21:25,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 15:21:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:25,421 INFO L225 Difference]: With dead ends: 128 [2023-12-02 15:21:25,421 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 15:21:25,421 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 15:21:25,422 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 149 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:25,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 180 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 15:21:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2023-12-02 15:21:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 119 states have internal predecessors, (128), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2023-12-02 15:21:25,426 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 11 [2023-12-02 15:21:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:25,426 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2023-12-02 15:21:25,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 15:21:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2023-12-02 15:21:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:21:25,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:25,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:21:25,427 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:25,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 327030839, now seen corresponding path program 1 times [2023-12-02 15:21:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144815690] [2023-12-02 15:21:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:25,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144815690] [2023-12-02 15:21:25,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144815690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:25,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:25,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:21:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349387201] [2023-12-02 15:21:25,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:21:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:21:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:25,656 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 15:21:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:26,089 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-12-02 15:21:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:21:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 15:21:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:26,090 INFO L225 Difference]: With dead ends: 123 [2023-12-02 15:21:26,090 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 15:21:26,091 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 15:21:26,091 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 144 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:26,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:21:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 15:21:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2023-12-02 15:21:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 100 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2023-12-02 15:21:26,095 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 11 [2023-12-02 15:21:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:26,096 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2023-12-02 15:21:26,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 15:21:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2023-12-02 15:21:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:21:26,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:26,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:26,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 15:21:26,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:26,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash 164325843, now seen corresponding path program 1 times [2023-12-02 15:21:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052171176] [2023-12-02 15:21:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:26,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052171176] [2023-12-02 15:21:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052171176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:26,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:21:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138555855] [2023-12-02 15:21:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:26,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:21:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:21:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:21:26,274 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:26,407 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2023-12-02 15:21:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:21:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:21:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:26,409 INFO L225 Difference]: With dead ends: 101 [2023-12-02 15:21:26,409 INFO L226 Difference]: Without dead ends: 101 [2023-12-02 15:21:26,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:26,410 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:26,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-02 15:21:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-02 15:21:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 states have internal predecessors, (107), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-12-02 15:21:26,414 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 12 [2023-12-02 15:21:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:26,414 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-12-02 15:21:26,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-12-02 15:21:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:21:26,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:26,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:26,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 15:21:26,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:26,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 164325844, now seen corresponding path program 1 times [2023-12-02 15:21:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464225187] [2023-12-02 15:21:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:26,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464225187] [2023-12-02 15:21:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464225187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:21:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919477072] [2023-12-02 15:21:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:26,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:21:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:21:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:26,834 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:27,161 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2023-12-02 15:21:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:21:27,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:21:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:27,165 INFO L225 Difference]: With dead ends: 160 [2023-12-02 15:21:27,165 INFO L226 Difference]: Without dead ends: 160 [2023-12-02 15:21:27,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:21:27,166 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 161 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:27,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 232 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-02 15:21:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 109. [2023-12-02 15:21:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 107 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2023-12-02 15:21:27,171 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 12 [2023-12-02 15:21:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:27,171 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2023-12-02 15:21:27,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2023-12-02 15:21:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:21:27,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:27,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:27,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 15:21:27,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:27,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2042218147, now seen corresponding path program 1 times [2023-12-02 15:21:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358237594] [2023-12-02 15:21:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:27,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:27,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358237594] [2023-12-02 15:21:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358237594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:27,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:27,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:21:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574923257] [2023-12-02 15:21:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:21:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:27,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:21:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:27,358 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:27,669 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-12-02 15:21:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:21:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:21:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:27,671 INFO L225 Difference]: With dead ends: 119 [2023-12-02 15:21:27,671 INFO L226 Difference]: Without dead ends: 119 [2023-12-02 15:21:27,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:21:27,672 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 139 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:27,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 175 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-02 15:21:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2023-12-02 15:21:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 106 states have internal predecessors, (115), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2023-12-02 15:21:27,676 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 15 [2023-12-02 15:21:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:27,676 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2023-12-02 15:21:27,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2023-12-02 15:21:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:21:27,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:27,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:27,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 15:21:27,677 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:27,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash 174750842, now seen corresponding path program 1 times [2023-12-02 15:21:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:27,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281457774] [2023-12-02 15:21:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:27,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:27,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281457774] [2023-12-02 15:21:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281457774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:27,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:21:27,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616495189] [2023-12-02 15:21:27,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:27,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:27,729 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:27,832 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2023-12-02 15:21:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 15:21:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:27,833 INFO L225 Difference]: With dead ends: 157 [2023-12-02 15:21:27,833 INFO L226 Difference]: Without dead ends: 157 [2023-12-02 15:21:27,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:27,834 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:27,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 124 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-02 15:21:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 107. [2023-12-02 15:21:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-12-02 15:21:27,839 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 16 [2023-12-02 15:21:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:27,839 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-12-02 15:21:27,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-12-02 15:21:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:21:27,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:27,840 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 15:21:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 15:21:27,840 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:27,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -622081400, now seen corresponding path program 1 times [2023-12-02 15:21:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979776696] [2023-12-02 15:21:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:27,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:27,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979776696] [2023-12-02 15:21:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979776696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:27,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:21:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415525232] [2023-12-02 15:21:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:27,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:27,906 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:28,012 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-12-02 15:21:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:21:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 15:21:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:28,013 INFO L225 Difference]: With dead ends: 106 [2023-12-02 15:21:28,013 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 15:21:28,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 15:21:28,014 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:28,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 199 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 15:21:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-12-02 15:21:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 104 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2023-12-02 15:21:28,018 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2023-12-02 15:21:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2023-12-02 15:21:28,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2023-12-02 15:21:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:21:28,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:28,019 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 15:21:28,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 15:21:28,020 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:28,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -590564444, now seen corresponding path program 1 times [2023-12-02 15:21:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905800582] [2023-12-02 15:21:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:28,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905800582] [2023-12-02 15:21:28,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905800582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:28,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:28,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:21:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923617956] [2023-12-02 15:21:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:28,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:21:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:21:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:28,383 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:28,614 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2023-12-02 15:21:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:21:28,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 15:21:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:28,616 INFO L225 Difference]: With dead ends: 134 [2023-12-02 15:21:28,616 INFO L226 Difference]: Without dead ends: 134 [2023-12-02 15:21:28,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:21:28,617 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:28,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 252 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-02 15:21:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 110. [2023-12-02 15:21:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 108 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2023-12-02 15:21:28,621 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 21 [2023-12-02 15:21:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:28,621 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2023-12-02 15:21:28,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2023-12-02 15:21:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:21:28,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:28,622 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 15:21:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 15:21:28,623 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:28,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -622050630, now seen corresponding path program 1 times [2023-12-02 15:21:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930157907] [2023-12-02 15:21:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:28,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930157907] [2023-12-02 15:21:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930157907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:21:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153235741] [2023-12-02 15:21:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:28,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:21:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:28,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:21:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:28,908 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 15:21:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:29,189 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2023-12-02 15:21:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:21:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 15:21:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:29,191 INFO L225 Difference]: With dead ends: 136 [2023-12-02 15:21:29,191 INFO L226 Difference]: Without dead ends: 136 [2023-12-02 15:21:29,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:21:29,192 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 136 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:29,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 169 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-02 15:21:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 115. [2023-12-02 15:21:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 113 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2023-12-02 15:21:29,196 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2023-12-02 15:21:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:29,196 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2023-12-02 15:21:29,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 15:21:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2023-12-02 15:21:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:21:29,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:29,197 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 15:21:29,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 15:21:29,197 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:29,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash -622050629, now seen corresponding path program 1 times [2023-12-02 15:21:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996170351] [2023-12-02 15:21:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:29,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996170351] [2023-12-02 15:21:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996170351] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:29,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:29,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:21:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109498065] [2023-12-02 15:21:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:29,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:21:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:21:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:21:29,567 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 15:21:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:29,838 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2023-12-02 15:21:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:21:29,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 15:21:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:29,840 INFO L225 Difference]: With dead ends: 139 [2023-12-02 15:21:29,841 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 15:21:29,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:21:29,842 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 50 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:29,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 244 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 15:21:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2023-12-02 15:21:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.375) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-12-02 15:21:29,846 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 21 [2023-12-02 15:21:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:29,846 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-12-02 15:21:29,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 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 15:21:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-12-02 15:21:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:21:29,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:29,847 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] [2023-12-02 15:21:29,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 15:21:29,847 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:29,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -763714707, now seen corresponding path program 1 times [2023-12-02 15:21:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231963248] [2023-12-02 15:21:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:21:30,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:30,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231963248] [2023-12-02 15:21:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231963248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:30,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 15:21:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604053342] [2023-12-02 15:21:30,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:30,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:21:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:30,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:21:30,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:21:30,255 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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 15:21:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:30,741 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2023-12-02 15:21:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:21:30,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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 21 [2023-12-02 15:21:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:30,743 INFO L225 Difference]: With dead ends: 121 [2023-12-02 15:21:30,743 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 15:21:30,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2023-12-02 15:21:30,744 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:30,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 326 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:21:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 15:21:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2023-12-02 15:21:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2023-12-02 15:21:30,749 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 21 [2023-12-02 15:21:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:30,749 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2023-12-02 15:21:30,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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 15:21:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2023-12-02 15:21:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:21:30,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:30,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:30,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 15:21:30,751 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:30,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash 830531664, now seen corresponding path program 1 times [2023-12-02 15:21:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219130653] [2023-12-02 15:21:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:31,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:31,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219130653] [2023-12-02 15:21:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219130653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:31,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:31,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 15:21:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018860650] [2023-12-02 15:21:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:31,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:21:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:31,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:21:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:21:31,307 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:31,577 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2023-12-02 15:21:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:21:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 15:21:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:31,579 INFO L225 Difference]: With dead ends: 137 [2023-12-02 15:21:31,579 INFO L226 Difference]: Without dead ends: 137 [2023-12-02 15:21:31,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:21:31,580 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 175 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:31,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 303 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:21:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-02 15:21:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2023-12-02 15:21:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-12-02 15:21:31,585 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 25 [2023-12-02 15:21:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:31,585 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-12-02 15:21:31,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-12-02 15:21:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 15:21:31,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:31,586 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 15:21:31,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 15:21:31,586 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:31,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 228498532, now seen corresponding path program 1 times [2023-12-02 15:21:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170506284] [2023-12-02 15:21:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:31,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170506284] [2023-12-02 15:21:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170506284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:21:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933668213] [2023-12-02 15:21:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:31,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:31,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:31,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:31,666 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 15:21:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:31,774 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-12-02 15:21:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:21:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 15:21:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:31,776 INFO L225 Difference]: With dead ends: 131 [2023-12-02 15:21:31,776 INFO L226 Difference]: Without dead ends: 131 [2023-12-02 15:21:31,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:31,777 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:31,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 81 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:21:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-02 15:21:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-12-02 15:21:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 120 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-12-02 15:21:31,781 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 29 [2023-12-02 15:21:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:31,781 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-12-02 15:21:31,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 15:21:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-12-02 15:21:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 15:21:31,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:31,783 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 15:21:31,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 15:21:31,783 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:21:31,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1022216661, now seen corresponding path program 1 times [2023-12-02 15:21:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027021035] [2023-12-02 15:21:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:32,461 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 15:21:32,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027021035] [2023-12-02 15:21:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027021035] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:21:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585396992] [2023-12-02 15:21:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:32,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:21:32,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:32,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:21:32,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:21:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:32,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 15:21:32,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:32,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:21:32,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:21:32,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:21:32,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:21:32,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:21:32,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:21:32,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:21:32,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:21:32,987 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 41 treesize of output 38 [2023-12-02 15:21:32,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:21:33,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 16 treesize of output 8 [2023-12-02 15:21:33,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:21:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:21:33,174 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 15:21:33,174 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 16 treesize of output 18 [2023-12-02 15:21:33,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:21:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:21:33,360 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:21:33,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-12-02 15:21:33,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:21:33,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 15:21:33,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:21:33,486 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 15:21:33,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:21:33,507 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_905 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-12-02 15:21:33,587 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_904) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2023-12-02 15:21:33,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:33,708 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 33 treesize of output 34 [2023-12-02 15:21:33,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-12-02 15:21:33,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 15:21:33,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (forall ((v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (not .cse1)) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0) (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)))) (or (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) .cse1))) is different from false [2023-12-02 15:21:34,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:21:34,740 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 168 treesize of output 137 [2023-12-02 15:21:34,748 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 257 treesize of output 233 [2023-12-02 15:21:34,760 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 219 treesize of output 213 [2023-12-02 15:21:34,933 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-12-02 15:21:34,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2023-12-02 15:21:34,981 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 230 treesize of output 218 [2023-12-02 15:21:47,090 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse14 (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse3 (not .cse6)) (.cse10 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse30 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (.cse9 (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse29 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (and (or (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20)))) .cse3) (or .cse3 (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27)))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) .cse3) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27)))))))) (or .cse6 (and (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) .cse9)) (or .cse6 (and .cse10 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_20) (= (select (select (store .cse11 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_20 |c_ULTIMATE.start_main_~x~0#1.base|))))))))) (or .cse3 (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27)))) (or (and (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) .cse14) .cse6) (or (and .cse14 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|)))))) .cse6) (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse6 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_arrayElimCell_27 Int)) (or (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= v_prenex_20 v_arrayElimCell_27))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901))) (or (= (select (select (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20)))) .cse3) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (or (and .cse10 (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int)) (v_arrayElimCell_20 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))))) .cse6) (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_arrayElimCell_27 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 v_arrayElimCell_27) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_27)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_20 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (or (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (forall ((v_prenex_17 (Array Int Int))) (= (select (select (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_17) v_arrayElimCell_27 v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= v_prenex_20 v_arrayElimCell_27))) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (and .cse9 (forall ((v_ArrVal_895 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_905 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_901))) (or (= (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_904) v_arrayElimCell_18 v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_897) v_arrayElimCell_20 v_ArrVal_901) |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= (select (select (store .cse27 |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_ArrVal_905) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| v_arrayElimCell_20))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse6) (or .cse6 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (or (not (= v_ArrVal_895 (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_895 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_895) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|))))))) is different from false [2023-12-02 15:22:02,515 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 12571 treesize of output 12533 [2023-12-02 15:22:02,634 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 1519 treesize of output 1511 [2023-12-02 15:22:02,660 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 1511 treesize of output 1495 [2023-12-02 15:22:02,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:03,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:22:03,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 19 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 19 new quantified variables, introduced 38 case distinctions, treesize of input 1495 treesize of output 4688 [2023-12-02 15:22:03,811 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 1305 treesize of output 1301 [2023-12-02 15:22:04,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1301 treesize of output 1297 [2023-12-02 15:22:04,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1297 treesize of output 1293 [2023-12-02 15:22:05,164 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 1293 treesize of output 1285 [2023-12-02 15:22:05,526 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 1285 treesize of output 1281 [2023-12-02 15:22:05,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 1281 treesize of output 1277 [2023-12-02 15:22:06,282 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 1277 treesize of output 1269 [2023-12-02 15:22:06,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 1269 treesize of output 1265 [2023-12-02 15:22:07,028 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 1265 treesize of output 1261 [2023-12-02 15:22:07,401 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 1261 treesize of output 1257 [2023-12-02 15:22:07,772 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 1257 treesize of output 1253 [2023-12-02 15:22:08,183 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 1253 treesize of output 1249 [2023-12-02 15:22:08,612 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 1249 treesize of output 1245 [2023-12-02 15:22:08,979 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 1245 treesize of output 1241 [2023-12-02 15:22:09,345 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 1241 treesize of output 1237 [2023-12-02 15:22:09,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 1237 treesize of output 1233 [2023-12-02 15:22:10,210 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 1233 treesize of output 1225 [2023-12-02 15:22:10,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1225 treesize of output 1213 [2023-12-02 15:22:11,021 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 1213 treesize of output 1209 [2023-12-02 15:22:11,406 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 1209 treesize of output 1197 [2023-12-02 15:22:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1197 treesize of output 1193 [2023-12-02 15:22:12,168 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 1193 treesize of output 1189 [2023-12-02 15:22:12,554 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 1189 treesize of output 1185 [2023-12-02 15:22:12,925 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 1185 treesize of output 1181 [2023-12-02 15:22:13,328 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 1181 treesize of output 1169 [2023-12-02 15:22:13,788 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 1169 treesize of output 1165 [2023-12-02 15:22:14,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1165 treesize of output 1161 [2023-12-02 15:22:14,575 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 1161 treesize of output 1153 [2023-12-02 15:22:15,010 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 1153 treesize of output 1149 [2023-12-02 15:22:15,435 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 1149 treesize of output 1145 [2023-12-02 15:22:15,980 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 1145 treesize of output 1141 [2023-12-02 15:22:16,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1141 treesize of output 1137 [2023-12-02 15:22:16,922 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 1137 treesize of output 1133 [2023-12-02 15:22:18,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:19,107 INFO L224 Elim1Store]: Index analysis took 464 ms [2023-12-02 15:22:19,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:19,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 18 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 2765 [2023-12-02 15:22:21,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:21,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:21,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:21,281 INFO L224 Elim1Store]: Index analysis took 193 ms [2023-12-02 15:22:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:22:21,335 INFO L349 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2023-12-02 15:22:21,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 17 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 1079 treesize of output 3221 [2023-12-02 15:22:22,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:22,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:22,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:22:22,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-02 15:22:23,105 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 15:22:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585396992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:22:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1312223753] [2023-12-02 15:22:23,124 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 15:22:23,124 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:22:23,129 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:22:23,133 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:22:23,134 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:22:24,473 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 217 for LOIs [2023-12-02 15:22:24,560 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:23:01,753 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5965#(exists ((|v_#length_90| (Array Int Int)) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int))) (|v_#valid_104| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int) (|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1| Int) (|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~x~0#1.base_116| Int) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|) 8) 0)) (= (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~x~0#1.base_116|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_96|) (select (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_96|)))) |v_#memory_$Pointer$.offset_88|) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|) 8) 1)) (<= 1 |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 8))))) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~x~0#1.base_116|) 1) (<= 12 (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|)) (= (store |v_#memory_int_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (store (select |v_#memory_int_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_96|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_96| (select (select |v_#memory_int_90| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|))) |v_#memory_int_90|) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 8))))) (<= (+ (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 1) |#StackHeapBarrier|) (= (select |v_#valid_104| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 0) (= |#length| (store |v_#length_90| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 12)) (not (= (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 0)) (= |#memory_int| (store |v_#memory_int_91| (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_int_91| (select (select (store |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_$Pointer$.base_93| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_116|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| 0)) (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_96|)) |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 8) 2))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1|) 1) (= |v_#memory_int_91| (store |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) (store (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4 (select (select |v_#memory_int_91| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|)) 4)))) (= (store |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.base_91| |v_ULTIMATE.start_main_~x~0#1.base_116|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_96|) (select (select |v_#memory_$Pointer$.base_92| |v_ULTIMATE.start_main_~x~0#1.base_116|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_96|)))) |v_#memory_$Pointer$.base_92|) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_1| 0)) (= (store |v_#memory_$Pointer$.base_92| |v_ULTIMATE.start_main_~x~0#1.base_116| (store (select |v_#memory_$Pointer$.base_92| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|))) |v_#memory_$Pointer$.base_93|) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_96|) (select |v_#length_90| |v_ULTIMATE.start_main_~x~0#1.base_116|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_96|) (= (store |v_#valid_104| (select (select |v_#memory_$Pointer$.base_93| |v_ULTIMATE.start_main_~x~0#1.base_116|) |v_ULTIMATE.start_main_~x~0#1.offset_96|) 1) |#valid|) (= |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_1| 0)))' at error location [2023-12-02 15:23:01,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:23:01,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:23:01,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 40 [2023-12-02 15:23:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263556013] [2023-12-02 15:23:01,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:23:01,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 15:23:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:23:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 15:23:01,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3203, Unknown=57, NotChecked=476, Total=4032 [2023-12-02 15:23:01,757 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:23:09,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:23:24,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:23:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:23:24,831 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2023-12-02 15:23:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 15:23:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 15:23:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:23:24,837 INFO L225 Difference]: With dead ends: 156 [2023-12-02 15:23:24,838 INFO L226 Difference]: Without dead ends: 156 [2023-12-02 15:23:24,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 64.2s TimeCoverageRelationStatistics Valid=478, Invalid=4587, Unknown=63, NotChecked=572, Total=5700 [2023-12-02 15:23:24,839 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 131 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 458 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:23:24,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 761 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1203 Invalid, 1 Unknown, 458 Unchecked, 11.0s Time] [2023-12-02 15:23:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-02 15:23:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2023-12-02 15:23:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 141 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:23:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2023-12-02 15:23:24,843 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 30 [2023-12-02 15:23:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:23:24,843 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2023-12-02 15:23:24,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:23:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2023-12-02 15:23:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 15:23:24,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:23:24,844 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, 1] [2023-12-02 15:23:24,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:23:25,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:23:25,044 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:23:25,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:23:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 441747135, now seen corresponding path program 1 times [2023-12-02 15:23:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:23:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527288329] [2023-12-02 15:23:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:23:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:23:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:23:25,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:23:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527288329] [2023-12-02 15:23:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527288329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:23:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:23:25,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:23:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516993486] [2023-12-02 15:23:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:23:25,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:23:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:23:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:23:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:23:25,114 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:23:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:23:25,261 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2023-12-02 15:23:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:23:25,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 15:23:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:23:25,262 INFO L225 Difference]: With dead ends: 142 [2023-12-02 15:23:25,262 INFO L226 Difference]: Without dead ends: 142 [2023-12-02 15:23:25,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 15:23:25,263 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:23:25,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:23:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-02 15:23:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-12-02 15:23:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 140 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:23:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2023-12-02 15:23:25,268 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 31 [2023-12-02 15:23:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:23:25,268 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2023-12-02 15:23:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:23:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2023-12-02 15:23:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 15:23:25,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:23:25,269 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 15:23:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 15:23:25,269 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:23:25,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:23:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1053702847, now seen corresponding path program 1 times [2023-12-02 15:23:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:23:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740837138] [2023-12-02 15:23:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:23:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:23:25,931 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 15:23:25,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:23:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740837138] [2023-12-02 15:23:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740837138] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:23:25,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413169646] [2023-12-02 15:23:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:23:25,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:23:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:23:25,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:23:25,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:23:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:23:26,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 15:23:26,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:23:26,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:23:26,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:23:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:23:26,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:23:26,342 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:23:26,342 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 15:23:26,389 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:23:26,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 15:23:26,478 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 15:23:26,479 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 16 treesize of output 18 [2023-12-02 15:23:26,492 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:23:26,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 15:23:26,543 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:23:26,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 15:23:26,657 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 15:23:26,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 48 [2023-12-02 15:23:26,743 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 15:23:26,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 57 [2023-12-02 15:23:26,877 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 15:23:26,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-12-02 15:23:26,880 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 15:23:26,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:23:27,328 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2023-12-02 15:23:27,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2023-12-02 15:23:27,339 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1090 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_100| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_100| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_100|) (= (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| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1091)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_100|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2023-12-02 15:23:27,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:27,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-12-02 15:23:27,365 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_22 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1091 (Array Int Int)) (v_ArrVal_1090 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_100| Int)) (let ((.cse1 (select v_arrayElimArr_22 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_22) .cse1 v_ArrVal_1090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1091)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_100|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse1) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_100| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_100|)))) is different from false [2023-12-02 15:23:27,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:27,783 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 134 treesize of output 86 [2023-12-02 15:23:27,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:27,803 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 3092 treesize of output 2867 [2023-12-02 15:23:27,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:27,901 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 744 treesize of output 684 [2023-12-02 15:23:27,921 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 670 treesize of output 638 [2023-12-02 15:23:27,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:27,947 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 511 treesize of output 395 [2023-12-02 15:23:27,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:23:27,974 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 516 treesize of output 468 [2023-12-02 15:23:28,050 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-12-02 15:23:28,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2023-12-02 15:23:28,871 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 15:23:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413169646] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:23:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1522486216] [2023-12-02 15:23:28,874 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 15:23:28,874 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:23:28,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:23:28,874 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:23:28,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:23:30,003 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:24:05,212 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6818#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_106| Int) (|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#valid_113| (Array Int Int)) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int))) (|v_#length_98| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_126| Int) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (<= 1 |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|))) |v_#memory_$Pointer$.base_127|) (= (store (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ 8 (select (select (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ 8 (select (select (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|))))) |#memory_$Pointer$.base|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (= (store |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_114| |v_ULTIMATE.start_main_~x~0#1.base_126|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (select (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|)))) |v_#memory_$Pointer$.offset_115|) (= (select |v_#valid_113| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 0) (= (store |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.base_125| |v_ULTIMATE.start_main_~x~0#1.base_126|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_main_~x~0#1.base_126|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|)))) |v_#memory_$Pointer$.base_126|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (store |v_#memory_int_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (store (select |v_#memory_int_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_106| (select (select |v_#memory_int_117| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|))) |v_#memory_int_117|) (<= (+ (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) |#StackHeapBarrier|) (= (store (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ 8 (select (select (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ 8 (select (select (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|))))) |#memory_$Pointer$.offset|) (= (store |v_#memory_int_117| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_int_117| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 (select (select |v_#memory_int_118| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4))) |v_#memory_int_118|) (= |#length| (store |v_#length_98| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 12)) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_106|) (select |v_#length_98| |v_ULTIMATE.start_main_~x~0#1.base_126|)) (= (select |v_#valid_113| |v_ULTIMATE.start_main_~x~0#1.base_126|) 1) (= (store |v_#valid_113| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 1) |#valid|) (= |#memory_int| (store |v_#memory_int_118| (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_int_118| (select (select (store |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select |v_#memory_$Pointer$.base_127| (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_126|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) (+ 8 (select (select (store (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) (store (select (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106| 0)) (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_106|)) |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|)) 2))) (not (= (select (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_main_~x~0#1.base_126|) |v_ULTIMATE.start_main_~x~0#1.offset_106|) 0)))) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))' at error location [2023-12-02 15:24:05,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:24:05,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:24:05,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 40 [2023-12-02 15:24:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487328650] [2023-12-02 15:24:05,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:24:05,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 15:24:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:24:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 15:24:05,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3574, Unknown=25, NotChecked=246, Total=4160 [2023-12-02 15:24:05,214 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 41 states, 40 states have (on average 2.2) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:24:07,359 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 15:24:09,526 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 15:24:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:24:11,127 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2023-12-02 15:24:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 15:24:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.2) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 15:24:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:24:11,129 INFO L225 Difference]: With dead ends: 196 [2023-12-02 15:24:11,129 INFO L226 Difference]: Without dead ends: 196 [2023-12-02 15:24:11,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=506, Invalid=4879, Unknown=25, NotChecked=290, Total=5700 [2023-12-02 15:24:11,132 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 508 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:24:11,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 839 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1667 Invalid, 2 Unknown, 375 Unchecked, 5.3s Time] [2023-12-02 15:24:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-02 15:24:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2023-12-02 15:24:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 158 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:24:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2023-12-02 15:24:11,135 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 30 [2023-12-02 15:24:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:24:11,136 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2023-12-02 15:24:11,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.2) internal successors, (88), 41 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:24:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2023-12-02 15:24:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 15:24:11,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:24:11,137 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 15:24:11,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 15:24:11,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:24:11,338 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:24:11,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:24:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1053702846, now seen corresponding path program 1 times [2023-12-02 15:24:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:24:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419986994] [2023-12-02 15:24:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:24:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:12,128 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 15:24:12,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:24:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419986994] [2023-12-02 15:24:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419986994] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:24:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437230705] [2023-12-02 15:24:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:12,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:24:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:24:12,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:24:12,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:24:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:12,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 15:24:12,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:24:12,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:24:12,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:24:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:24:12,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:24:12,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:24:12,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:24:12,466 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 41 treesize of output 38 [2023-12-02 15:24:12,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:24:12,543 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:24:12,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2023-12-02 15:24:12,549 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 15:24:12,568 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:24:12,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 15:24:12,721 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:24:12,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 15:24:12,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:24:12,738 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 15:24:12,738 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 16 treesize of output 18 [2023-12-02 15:24:12,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:24:12,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:24:12,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-02 15:24:12,822 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:24:12,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 15:24:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:24:12,830 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 16 [2023-12-02 15:24:12,972 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 15:24:12,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 60 [2023-12-02 15:24:12,979 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 31 treesize of output 16 [2023-12-02 15:24:13,098 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 15:24:13,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 71 [2023-12-02 15:24:13,104 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 39 treesize of output 16 [2023-12-02 15:24:13,308 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 15:24:13,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-12-02 15:24:13,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 15:24:13,365 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 15:24:13,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:24:14,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:14,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 106 [2023-12-02 15:24:14,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:14,781 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 231 treesize of output 235 [2023-12-02 15:24:16,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:16,639 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 627 treesize of output 452 [2023-12-02 15:24:16,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:16,655 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 443 treesize of output 404 [2023-12-02 15:24:16,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:16,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23437 treesize of output 21023 [2023-12-02 15:24:17,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:17,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27020 treesize of output 26702 [2023-12-02 15:24:17,492 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 3655 treesize of output 3619 [2023-12-02 15:24:17,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:17,587 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 3619 treesize of output 3622 [2023-12-02 15:24:17,664 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 3613 treesize of output 3573 [2023-12-02 15:24:17,734 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 3573 treesize of output 3561 [2023-12-02 15:24:17,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3561 treesize of output 3531 [2023-12-02 15:24:17,876 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 3531 treesize of output 3485 [2023-12-02 15:24:17,954 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 3485 treesize of output 3473 [2023-12-02 15:24:18,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:18,042 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 3473 treesize of output 3476 [2023-12-02 15:24:18,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3467 treesize of output 3417 [2023-12-02 15:24:18,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3417 treesize of output 3405 [2023-12-02 15:24:18,268 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 3405 treesize of output 3397 [2023-12-02 15:24:18,343 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 3397 treesize of output 3361 [2023-12-02 15:24:18,416 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 3361 treesize of output 3307 [2023-12-02 15:24:18,509 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 3307 treesize of output 3295 [2023-12-02 15:24:19,256 INFO L349 Elim1Store]: treesize reduction 4, result has 99.1 percent of original size [2023-12-02 15:24:19,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 3302 treesize of output 3696 [2023-12-02 15:24:19,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:19,964 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 3320 treesize of output 3046 [2023-12-02 15:24:20,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:20,146 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 3054 treesize of output 2978 [2023-12-02 15:24:20,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:20,335 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 2986 treesize of output 2894 [2023-12-02 15:24:20,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:20,519 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 2811 treesize of output 2754 [2023-12-02 15:24:20,689 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 2745 treesize of output 2719 [2023-12-02 15:24:20,854 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 2719 treesize of output 2717 [2023-12-02 15:24:21,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:21,044 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 2717 treesize of output 2650 [2023-12-02 15:24:21,218 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 2641 treesize of output 2595 [2023-12-02 15:24:21,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:24:21,412 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 2686 treesize of output 2600 [2023-12-02 15:24:21,587 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 2519 treesize of output 2517 [2023-12-02 15:26:27,637 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 15:26:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437230705] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:26:27,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1704417840] [2023-12-02 15:26:27,640 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 15:26:27,640 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:26:27,640 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:26:27,640 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:26:27,640 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:26:28,761 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:27:26,761 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7438#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8))) (or (< (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) 0) (< (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (+ 12 |ULTIMATE.start_main_~x~0#1.offset|))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_#memory_$Pointer$.offset_148| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_118| Int) (|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int))) (|v_#length_107| (Array Int Int)) (|v_#valid_122| (Array Int Int)) (|v_#memory_$Pointer$.base_161| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_160| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_137| Int) (|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (= |v_#memory_$Pointer$.offset_149| (store |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_main_~x~0#1.base_137|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (select (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_118|))))) (<= 1 |#StackHeapBarrier|) (= (store |v_#memory_int_144| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_int_144| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 (select (select |v_#memory_int_145| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4))) |v_#memory_int_145|) (= (select |v_#valid_122| |v_ULTIMATE.start_main_~x~0#1.base_137|) 1) (not (= (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 0)) (= (select |v_#valid_122| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 0) (= (store |v_#memory_int_142| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (store (select |v_#memory_int_142| |v_ULTIMATE.start_main_~x~0#1.base_137|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_118|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_118| (select (select |v_#memory_int_144| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|))) |v_#memory_int_144|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 8))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 8))))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |#valid| (store |v_#valid_122| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 1)) (<= (+ (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 1) |#StackHeapBarrier|) (= |#memory_int| (store |v_#memory_int_145| (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_int_145| (select (select (store |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_161| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_137|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| 0)) (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 8) 2))) (= |v_#memory_$Pointer$.base_160| (store |v_#memory_$Pointer$.base_159| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.base_159| |v_ULTIMATE.start_main_~x~0#1.base_137|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (select (select |v_#memory_$Pointer$.base_160| |v_ULTIMATE.start_main_~x~0#1.base_137|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_118|))))) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (select |v_#length_107| |v_ULTIMATE.start_main_~x~0#1.base_137|)) (= (store |v_#memory_$Pointer$.base_160| |v_ULTIMATE.start_main_~x~0#1.base_137| (store (select |v_#memory_$Pointer$.base_160| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|))) |v_#memory_$Pointer$.base_161|) (= (store |v_#length_107| (select (select |v_#memory_$Pointer$.base_161| |v_ULTIMATE.start_main_~x~0#1.base_137|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 12) |#length|))) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)))' at error location [2023-12-02 15:27:26,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:27:26,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:27:26,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 42 [2023-12-02 15:27:26,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480251468] [2023-12-02 15:27:26,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:27:26,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 15:27:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:27:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 15:27:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4085, Unknown=31, NotChecked=0, Total=4422 [2023-12-02 15:27:26,765 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 43 states, 42 states have (on average 2.142857142857143) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:34,792 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2023-12-02 15:27:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 15:27:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.142857142857143) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 15:27:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:34,794 INFO L225 Difference]: With dead ends: 212 [2023-12-02 15:27:34,794 INFO L226 Difference]: Without dead ends: 212 [2023-12-02 15:27:34,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=651, Invalid=6973, Unknown=32, NotChecked=0, Total=7656 [2023-12-02 15:27:34,796 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 610 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 112 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:34,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1151 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2332 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 15:27:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-02 15:27:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 166. [2023-12-02 15:27:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 164 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 184 transitions. [2023-12-02 15:27:34,802 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 184 transitions. Word has length 30 [2023-12-02 15:27:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:34,802 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 184 transitions. [2023-12-02 15:27:34,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.142857142857143) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 184 transitions. [2023-12-02 15:27:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 15:27:34,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:34,803 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, 1] [2023-12-02 15:27:34,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:27:35,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:35,003 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:27:35,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 441841211, now seen corresponding path program 1 times [2023-12-02 15:27:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:27:35,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718645902] [2023-12-02 15:27:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:27:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:27:35,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:27:35,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718645902] [2023-12-02 15:27:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718645902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:27:35,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:27:35,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 15:27:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316918735] [2023-12-02 15:27:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:27:35,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:27:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:27:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:27:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:27:35,290 INFO L87 Difference]: Start difference. First operand 166 states and 184 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:27:35,610 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2023-12-02 15:27:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:27:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 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 15:27:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:27:35,612 INFO L225 Difference]: With dead ends: 230 [2023-12-02 15:27:35,612 INFO L226 Difference]: Without dead ends: 230 [2023-12-02 15:27:35,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-02 15:27:35,613 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 132 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:27:35,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 328 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:27:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-02 15:27:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 175. [2023-12-02 15:27:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 173 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2023-12-02 15:27:35,619 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 194 transitions. Word has length 31 [2023-12-02 15:27:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:27:35,619 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 194 transitions. [2023-12-02 15:27:35,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:27:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 194 transitions. [2023-12-02 15:27:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 15:27:35,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:27:35,620 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, 1] [2023-12-02 15:27:35,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 15:27:35,621 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:27:35,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:27:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash 543765045, now seen corresponding path program 1 times [2023-12-02 15:27:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:27:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439300981] [2023-12-02 15:27:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:27:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:27:35,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:27:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439300981] [2023-12-02 15:27:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439300981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:27:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199626710] [2023-12-02 15:27:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:27:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:27:35,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:27:35,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:27:35,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:27:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:27:36,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 15:27:36,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:27:36,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:27:36,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:27:36,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:27:36,288 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:27:36,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 15:27:36,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:27:36,330 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 15:27:36,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 15:27:36,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 15:27:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:27:36,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:27:36,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:36,583 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 29 [2023-12-02 15:27:37,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:37,026 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 69 treesize of output 46 [2023-12-02 15:27:37,053 INFO L349 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2023-12-02 15:27:37,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 256 treesize of output 237 [2023-12-02 15:27:37,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 151 [2023-12-02 15:27:37,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:37,093 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 151 treesize of output 151 [2023-12-02 15:27:37,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:37,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2023-12-02 15:27:37,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:37,292 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 141 treesize of output 128 [2023-12-02 15:27:37,300 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 76 treesize of output 72 [2023-12-02 15:27:37,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:27:37,310 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 72 treesize of output 71 [2023-12-02 15:27:37,450 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:27:37,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-12-02 15:27:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:27:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199626710] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:27:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [989766321] [2023-12-02 15:27:37,577 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-12-02 15:27:37,577 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:27:37,578 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:27:37,578 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:27:37,578 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:27:38,246 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:29:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [989766321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:29:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:29:32,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [12, 13, 14] total 52 [2023-12-02 15:29:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434362315] [2023-12-02 15:29:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:29:32,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 15:29:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:29:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 15:29:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2144, Unknown=63, NotChecked=0, Total=2652 [2023-12-02 15:29:32,895 INFO L87 Difference]: Start difference. First operand 175 states and 194 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:29:37,692 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 15:29:39,704 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] [2023-12-02 15:29:41,745 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 15:29:44,517 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 15:29:46,756 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 15:29:48,766 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] [2023-12-02 15:29:50,818 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 15:29:53,291 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 15:29:55,702 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 15:29:57,784 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 15:30:00,088 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 15:30:02,709 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] [2023-12-02 15:30:05,193 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 15:30:07,504 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 15:30:09,944 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 15:30:16,629 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 15:30:18,637 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] [2023-12-02 15:30:21,076 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] [2023-12-02 15:30:23,367 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 15:30:25,425 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 15:30:27,674 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 15:30:29,859 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 15:30:34,895 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 15:30:36,904 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] [2023-12-02 15:30:38,974 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 15:30:41,287 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 15:30:44,167 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 15:30:46,175 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] [2023-12-02 15:30:48,292 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 15:30:50,699 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 15:30:52,904 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 15:30:58,076 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 15:31:00,085 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] [2023-12-02 15:31:02,186 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 15:31:04,569 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 15:31:07,508 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] [2023-12-02 15:31:09,517 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] [2023-12-02 15:31:11,526 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] [2023-12-02 15:31:13,535 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] [2023-12-02 15:31:16,644 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 15:31:19,902 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 15:31:22,793 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 15:31:26,220 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] [2023-12-02 15:31:28,616 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 15:31:30,627 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] [2023-12-02 15:31:33,108 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 15:31:35,588 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] [2023-12-02 15:31:38,066 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 15:31:40,074 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] [2023-12-02 15:31:42,543 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 15:31:45,004 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] [2023-12-02 15:31:47,337 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 15:31:49,347 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] [2023-12-02 15:31:51,451 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 15:31:53,758 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 15:31:56,126 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 15:31:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:57,929 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2023-12-02 15:31:57,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 15:31:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 15:31:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:57,930 INFO L225 Difference]: With dead ends: 175 [2023-12-02 15:31:57,930 INFO L226 Difference]: Without dead ends: 175 [2023-12-02 15:31:57,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 125.4s TimeCoverageRelationStatistics Valid=445, Invalid=2144, Unknown=63, NotChecked=0, Total=2652 [2023-12-02 15:31:57,932 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 0 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:57,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 402 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1093 Invalid, 73 Unknown, 0 Unchecked, 135.0s Time] [2023-12-02 15:31:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-02 15:31:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-12-02 15:31:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.2483660130718954) internal successors, (191), 173 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2023-12-02 15:31:57,936 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 31 [2023-12-02 15:31:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:57,936 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 193 transitions. [2023-12-02 15:31:57,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 193 transitions. [2023-12-02 15:31:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 15:31:57,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:57,937 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, 1, 1] [2023-12-02 15:31:57,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:31:58,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 15:31:58,138 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:31:58,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash 812175930, now seen corresponding path program 1 times [2023-12-02 15:31:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051730437] [2023-12-02 15:31:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:58,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:58,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051730437] [2023-12-02 15:31:58,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051730437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:58,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:58,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 15:31:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918705938] [2023-12-02 15:31:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:58,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:31:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:31:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:31:58,499 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:58,777 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2023-12-02 15:31:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:31:58,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 15:31:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:58,779 INFO L225 Difference]: With dead ends: 202 [2023-12-02 15:31:58,779 INFO L226 Difference]: Without dead ends: 202 [2023-12-02 15:31:58,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:31:58,779 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 103 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:58,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 256 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:31:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-12-02 15:31:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 176. [2023-12-02 15:31:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 174 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2023-12-02 15:31:58,784 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 32 [2023-12-02 15:31:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:58,784 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2023-12-02 15:31:58,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2023-12-02 15:31:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:31:58,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:58,785 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, 1, 1, 1] [2023-12-02 15:31:58,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-02 15:31:58,785 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:31:58,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -592349667, now seen corresponding path program 1 times [2023-12-02 15:31:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:58,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484353769] [2023-12-02 15:31:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:58,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:58,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484353769] [2023-12-02 15:31:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484353769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:31:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197172307] [2023-12-02 15:31:58,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:31:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:31:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:31:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:31:58,891 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:31:59,141 INFO L93 Difference]: Finished difference Result 216 states and 235 transitions. [2023-12-02 15:31:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:31:59,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-12-02 15:31:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:31:59,142 INFO L225 Difference]: With dead ends: 216 [2023-12-02 15:31:59,142 INFO L226 Difference]: Without dead ends: 216 [2023-12-02 15:31:59,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:31:59,143 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 149 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:31:59,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 195 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:31:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-02 15:31:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 176. [2023-12-02 15:31:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.2402597402597402) internal successors, (191), 174 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2023-12-02 15:31:59,147 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 33 [2023-12-02 15:31:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:31:59,148 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2023-12-02 15:31:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2023-12-02 15:31:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 15:31:59,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:31:59,148 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, 1, 1, 1] [2023-12-02 15:31:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-02 15:31:59,149 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:31:59,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:31:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1666986153, now seen corresponding path program 1 times [2023-12-02 15:31:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:31:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535545292] [2023-12-02 15:31:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:31:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:59,755 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 15:31:59,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:31:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535545292] [2023-12-02 15:31:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535545292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:31:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193787274] [2023-12-02 15:31:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:31:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:31:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:31:59,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:31:59,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:31:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:31:59,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:31:59,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:31:59,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:31:59,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:31:59,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:31:59,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:32:00,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:32:00,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:32:00,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:32:00,159 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:00,159 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 57 treesize of output 50 [2023-12-02 15:32:00,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:32:00,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:32:00,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 15:32:00,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,351 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 15:32:00,351 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 16 treesize of output 18 [2023-12-02 15:32:00,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:32:00,548 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:00,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2023-12-02 15:32:00,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:32:00,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:32:00,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 15:32:00,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:00,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:00,659 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 17 treesize of output 15 [2023-12-02 15:32:00,735 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 15:32:00,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:01,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:01,138 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 34 treesize of output 35 [2023-12-02 15:32:01,141 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 63 treesize of output 55 [2023-12-02 15:32:01,144 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 47 treesize of output 45 [2023-12-02 15:32:01,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:01,956 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 59 treesize of output 51 [2023-12-02 15:32:01,961 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 97 treesize of output 85 [2023-12-02 15:32:01,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 78 treesize of output 74 [2023-12-02 15:32:02,021 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-12-02 15:32:02,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2023-12-02 15:32:02,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_arrayElimCell_224 Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_29| Int) (v_ArrVal_1627 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1612 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1612)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_29| v_arrayElimCell_224) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_29| |c_ULTIMATE.start_main_~x~0#1.base|) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1615) v_arrayElimCell_224 v_ArrVal_1620) |v_ULTIMATE.start_main_#t~malloc6#1.base_29| v_ArrVal_1627) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|)) 1)))) (not .cse1)) (or .cse1 (forall ((v_ArrVal_1612 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (|v_ULTIMATE.start_main_#t~malloc6#1.base_29| Int) (v_ArrVal_1627 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1612 |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1612)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_29| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1620) |v_ULTIMATE.start_main_#t~malloc6#1.base_29| v_ArrVal_1627) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|)) 1)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_29| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0)))))) is different from false [2023-12-02 15:32:02,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:02,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-02 15:32:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-02 15:32:02,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:02,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:32:02,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-12-02 15:32:02,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:02,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2023-12-02 15:32:02,507 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 15:32:02,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 15:32:02,608 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 15:32:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193787274] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:32:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910377483] [2023-12-02 15:32:02,610 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 15:32:02,610 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:32:02,610 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:32:02,611 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:32:02,611 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:32:03,874 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 229 for LOIs [2023-12-02 15:32:03,973 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:32:38,388 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9943#(exists ((|v_ULTIMATE.start_main_~x~0#1.offset_137| Int) (|v_#memory_$Pointer$.base_209| (Array Int (Array Int Int))) (|v_#valid_136| (Array Int Int)) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int))) (|v_#length_118| (Array Int Int)) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_2| Int) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_157| Int) (|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2| Int) (|v_#memory_$Pointer$.offset_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_197| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_194| (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_int_194| (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 8) 2))) (<= (+ 12 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))) (<= (+ (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 1) |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0)) 1) (<= 1 |#StackHeapBarrier|) (= (store |v_#valid_136| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 1) |#valid|) (= (select |v_#valid_136| |v_ULTIMATE.start_main_~x~0#1.base_157|) 1) (= |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_2| 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 8) 1) (= (store |v_#memory_int_193| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_int_193| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 (select (select |v_#memory_int_194| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4))) |v_#memory_int_194|) (not (= (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 0)) (not (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))))) (= (store |v_#length_118| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 12) |#length|) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_137|) (select |v_#length_118| |v_ULTIMATE.start_main_~x~0#1.base_157|)) (= (select |#valid| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 1) (= (store |v_#memory_$Pointer$.offset_196| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_196| |v_ULTIMATE.start_main_~x~0#1.base_157|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_137|) (select (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_137|)))) |v_#memory_$Pointer$.offset_197|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 8) (select (select |#memory_$Pointer$.offset| (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 8))))) (<= 0 (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|) 0))) (= (store |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_157|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_137|) (select (select |v_#memory_$Pointer$.base_208| |v_ULTIMATE.start_main_~x~0#1.base_157|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_137|)))) |v_#memory_$Pointer$.base_208|) (<= 12 (select |#length| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2|)) (= (store (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 8) (select (select |#memory_$Pointer$.base| (select (select (store |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select |v_#memory_$Pointer$.base_209| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.base_157|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) (store (select (store |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.offset_197| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| 0)) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 4 |v_ULTIMATE.start_main_~x~0#1.offset_137|)) |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|) 8)))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_191| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (store (select |v_#memory_int_191| |v_ULTIMATE.start_main_~x~0#1.base_157|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_137|) 1) |v_ULTIMATE.start_main_~x~0#1.offset_137| (select (select |v_#memory_int_193| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|))) |v_#memory_int_193|) (= (select |v_#valid_136| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|)) 0) (not (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_2| 0)) (= (store |v_#memory_$Pointer$.base_208| |v_ULTIMATE.start_main_~x~0#1.base_157| (store (select |v_#memory_$Pointer$.base_208| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137| (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_157|) |v_ULTIMATE.start_main_~x~0#1.offset_137|))) |v_#memory_$Pointer$.base_209|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_137|)))' at error location [2023-12-02 15:32:38,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:32:38,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:32:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 45 [2023-12-02 15:32:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879039877] [2023-12-02 15:32:38,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:32:38,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 15:32:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:32:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 15:32:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=4474, Unknown=41, NotChecked=136, Total=4970 [2023-12-02 15:32:38,391 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:40,552 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2023-12-02 15:32:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 15:32:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 15:32:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:40,553 INFO L225 Difference]: With dead ends: 156 [2023-12-02 15:32:40,553 INFO L226 Difference]: Without dead ends: 156 [2023-12-02 15:32:40,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=516, Invalid=6089, Unknown=41, NotChecked=160, Total=6806 [2023-12-02 15:32:40,555 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 104 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:40,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 840 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1566 Invalid, 0 Unknown, 108 Unchecked, 1.3s Time] [2023-12-02 15:32:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-02 15:32:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2023-12-02 15:32:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.2325581395348837) internal successors, (159), 149 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2023-12-02 15:32:40,558 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 34 [2023-12-02 15:32:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:40,558 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2023-12-02 15:32:40,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2023-12-02 15:32:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 15:32:40,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:40,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:40,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:32:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:40,759 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 15:32:40,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1261788050, now seen corresponding path program 1 times [2023-12-02 15:32:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:32:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252780823] [2023-12-02 15:32:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:32:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:41,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:32:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252780823] [2023-12-02 15:32:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252780823] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:32:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235645867] [2023-12-02 15:32:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:32:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:32:41,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:32:41,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629c2cc7-085b-44e4-abd9-778cf68741ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:32:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:42,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 15:32:42,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:42,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:32:42,136 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:32:42,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:32:42,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:32:42,242 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:32:42,242 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 15:32:42,298 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:32:42,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 15:32:42,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:42,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:42,399 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 15:32:42,399 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 16 treesize of output 18 [2023-12-02 15:32:42,410 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 15:32:42,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 15:32:42,417 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 13 treesize of output 9 [2023-12-02 15:32:42,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:42,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:42,477 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-02 15:32:42,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 15:32:42,483 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 25 treesize of output 13 [2023-12-02 15:32:42,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:32:42,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:32:42,624 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 15:32:42,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2023-12-02 15:32:42,629 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 26 treesize of output 13 [2023-12-02 15:32:42,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 15:32:42,715 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-12-02 15:32:42,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 121 [2023-12-02 15:32:42,729 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-12-02 15:32:42,729 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 118 treesize of output 111 [2023-12-02 15:32:42,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 21 [2023-12-02 15:32:42,845 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 15:32:42,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2023-12-02 15:32:42,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 15:32:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:32:42,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:32:43,178 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_142| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_142|) (< |v_ULTIMATE.start_main_~x~0#1.offset_142| 0) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1772))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1774) .cse1 v_ArrVal_1777) (select (select (store .cse2 .cse1 v_ArrVal_1775) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_142|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1773) .cse1 v_ArrVal_1776) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_142|) 8))))) 1))) is different from false [2023-12-02 15:32:43,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1771 Int) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1772 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_142| Int) (v_ArrVal_1770 (Array Int Int))) (or (= (let ((.cse1 (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|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1772))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1771)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1774) .cse0 v_ArrVal_1777) (select (select (store .cse1 .cse0 v_ArrVal_1775) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_142|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1773) .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_142|) 8)))) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_142|) (< |v_ULTIMATE.start_main_~x~0#1.offset_142| 0))) is different from false [2023-12-02 15:32:43,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:43,217 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 96 treesize of output 102 [2023-12-02 15:32:43,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:43,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 78 [2023-12-02 15:32:43,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:43,242 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 419 treesize of output 418 [2023-12-02 15:32:43,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 189 treesize of output 158 [2023-12-02 15:32:43,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 256 [2023-12-02 15:32:44,836 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 74 treesize of output 54 [2023-12-02 15:32:44,853 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 131 treesize of output 99 [2023-12-02 15:32:44,873 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 153 treesize of output 117 [2023-12-02 15:32:44,893 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 71 treesize of output 55 [2023-12-02 15:32:44,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:44,919 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 1540 treesize of output 1079 [2023-12-02 15:32:44,930 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 89 treesize of output 87 [2023-12-02 15:32:44,939 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 87 treesize of output 83 [2023-12-02 15:32:44,948 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 90 treesize of output 82 [2023-12-02 15:32:47,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:47,047 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 1656 treesize of output 1025 [2023-12-02 15:32:47,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:47,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99587 treesize of output 89231 [2023-12-02 15:32:53,573 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 21703 treesize of output 21621 [2023-12-02 15:32:54,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:54,370 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 21621 treesize of output 21510 [2023-12-02 15:32:55,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:55,052 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 21501 treesize of output 21364 [2023-12-02 15:32:55,625 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 21355 treesize of output 21287 [2023-12-02 15:32:56,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:32:56,234 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 21287 treesize of output 21160 [2023-12-02 15:33:04,275 WARN L293 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 671 DAG size of output: 669 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 15:33:04,276 INFO L349 Elim1Store]: treesize reduction 4, result has 99.8 percent of original size [2023-12-02 15:33:04,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 21158 treesize of output 22776 [2023-12-02 15:33:09,664 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 2032 DAG size of output: 1973 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 15:33:11,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:11,374 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 20995 treesize of output 20730 [2023-12-02 15:33:13,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:13,154 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 20918 treesize of output 20558 [2023-12-02 15:33:14,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:14,848 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 20387 treesize of output 20292 [2023-12-02 15:33:16,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:16,533 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 20478 treesize of output 20240 [2023-12-02 15:33:18,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:18,229 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 20071 treesize of output 19932 [2023-12-02 15:33:19,856 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 19923 treesize of output 19803 [2023-12-02 15:33:21,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:21,566 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 19996 treesize of output 19582 [2023-12-02 15:33:23,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:23,285 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 19415 treesize of output 19328 [2023-12-02 15:33:25,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:25,047 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 19510 treesize of output 19146 [2023-12-02 15:33:26,706 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 18981 treesize of output 18851 [2023-12-02 15:33:28,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:28,468 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 19040 treesize of output 18380 [2023-12-02 15:33:30,148 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 18217 treesize of output 18153 [2023-12-02 15:33:31,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:31,877 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 18340 treesize of output 18204 [2023-12-02 15:33:33,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:33,681 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 18228 treesize of output 17930 [2023-12-02 15:33:35,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:35,587 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 17954 treesize of output 17448 [2023-12-02 15:33:37,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:37,347 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 17291 treesize of output 17218 [2023-12-02 15:33:39,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:39,107 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 17390 treesize of output 16420 [2023-12-02 15:33:40,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:40,906 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 16444 treesize of output 15858 [2023-12-02 15:33:43,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:43,323 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 15705 treesize of output 15558 [2023-12-02 15:33:45,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:45,145 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 15726 treesize of output 15304 [2023-12-02 15:33:46,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:46,973 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 15328 treesize of output 15102 [2023-12-02 15:33:48,718 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 14953 treesize of output 14877 [2023-12-02 15:33:50,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14877 treesize of output 14597 [2023-12-02 15:33:52,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:52,263 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 14597 treesize of output 14426 [2023-12-02 15:33:54,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:54,073 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 14590 treesize of output 14536 [2023-12-02 15:33:55,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:33:55,899 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 14560 treesize of output 14428 [2023-12-02 15:33:57,762 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 14283 treesize of output 14247